Tree Decompositions with Small Cost

DOI10.1007/3-540-45471-3_39zbMath1078.68671MaRDI QIDQ3046513

Hans L. Bodlaender, Fedor V. Fomin

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

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

Related Items

Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs