On two techniques of combining branching and treewidth
From MaRDI portal
Publication:1022343
DOI10.1007/s00453-007-9133-3zbMath1185.68475WikidataQ60488698 ScholiaQ60488698MaRDI QIDQ1022343
Serge Gaspers, Fedor V. Fomin, Saket Saurabh, Alexey A. Stepanov
Publication date: 22 June 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9133-3
treewidth; parameterized algorithms; exact exponential time algorithms; minimum maximal matching; \(k\)-Weighted vertex cover; \#3-Coloring; \#minimum dominating set; NP hard problems
68W05: Nonnumerical algorithms
68R10: Graph theory (including graph drawing) in computer science
90C39: Dynamic programming