A note on exact algorithms for vertex ordering problems on graphs

DOI10.1007/s00224-011-9312-0zbMath1253.68164WikidataQ59567532 ScholiaQ59567532MaRDI QIDQ692902

Dieter Kratsch, Hans L. Bodlaender, Fedor V. Fomin, Dimitrios M. Thilikos, Arie M. C. A. Koster

Publication date: 6 December 2012

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-011-9312-0

zbMATH Keywords

algorithms; graphs; exact algorithms; exponential time algorithms; vertex ordering problems

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)