Tree-decompositions of small pathwidth
From MaRDI portal
Publication:5899355
DOI10.1016/S1571-0653(04)00410-XzbMath1184.05126MaRDI QIDQ5899355
Publication date: 29 May 2007
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
68W40: Analysis of algorithms
05C05: Trees
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- All structured programs have small tree width and good register allocation
- Triangulating multitolerance graphs
- Memory requirements for table computations in partial \(k\)-tree algorithms
- Triangulating graphs without asteroidal triples
- Representation of a finite graph by a set of intervals on the real line
- Complexity of Finding Embeddings in a k-Tree