Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In
From MaRDI portal
Publication:3525813
DOI10.1007/11682462_73zbMath1145.68475MaRDI QIDQ3525813
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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science