"A T-decomposition algorithm with O(n log n) time and space complexity."

Jia Yang, Ulrich Speidel (2005)

> Home

Details and statistics

DOI: 10.1109/ISIT.2005.1523285

access: closed

type: Conference or Workshop Paper

metadata version: 2019-02-15

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isit/YangS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/YangS05
Jia Yang, Ulrich Speidel:
A T-decomposition algorithm with O(n log n) time and space complexity. ISIT 2005: 23-27

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.