Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In

DOI10.1007/11682462_73zbMath1145.68475MaRDI QIDQ3525813

Yngve Villanger

Publication date: 18 September 2008

Published in: LATIN 2006: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11682462_73

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

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