Tree Decompositions with Small Cost

DOI10.1007/3-540-45471-3_39MaRDI QIDQ3046513zbMATH OpenOpenAlexFDO

Authors Fedor V. Fomin, Hans L. Bodlaender

Publication date 12 August 2004

Published in Algorithm Theory — SWAT 2002 (Search for Journal in Brave)

Full work available at URL https://dspace.library.uu.nl/handle/1874/2577

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Tree decompositions with small cost
• Minimum size tree-decompositions
• Minimum size tree-decompositions
• Algorithms finding tree-decompositions of graphs
• scientific article; zbMATH DE number 1420906

Cited in

(5)

• Tree decompositions with small cost
• Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
• Tree Decompositions of Graphs: Saving Memory in Dynamic Programming
• scientific article; zbMATH DE number 1420905 (Why is no real title available?)
• Minimum size tree-decompositions

This page was built for publication: Tree Decompositions with Small Cost

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046513)