Tree-decompositions of small pathwidth

DOI10.1016/S1571-0653(04)00410-XzbMath1184.05126OpenAlexW2175868772MaRDI QIDQ5899355

Jan Arne Telle

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00410-x

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Tree decompositions with small cost

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

This page was built for publication: Tree-decompositions of small pathwidth