A Note on Exact Algorithms for Vertex Ordering Problems on Graphs

In this note, we give a proof that several vertex ordering problems can be solved in O ∗ (2 n ) time and O ∗ (2 n ) space, or in O ∗ (4 n ) time and polynomial space. The algorithms generalize algorithms for the Travelling Salesman Problem by Held and Karp (J. Soc. Ind. Appl. Math. 10:196–210, 1962...

Full description

Saved in:
Bibliographic Details
Published inTheory of computing systems Vol. 50; no. 3; pp. 420 - 432
Main Authors Bodlaender, Hans L., Fomin, Fedor V., Koster, Arie M. C. A., Kratsch, Dieter, Thilikos, Dimitrios M.
Format Journal Article
LanguageEnglish
Published New York Springer-Verlag 01.04.2012
Springer Nature B.V
Subjects
Algorithms
Computation
Computer Science
Dynamic programming
Graph theory
Graphs
Mathematical analysis
Order disorder
Proving
Studies
Theory of Computation
Graphs
Exponential time algorithms
Algorithms
Vertex ordering problems
Exact algorithms
Online AccessGet full text

Cover

More Information
Summary:In this note, we give a proof that several vertex ordering problems can be solved in O ∗ (2 n ) time and O ∗ (2 n ) space, or in O ∗ (4 n ) time and polynomial space. The algorithms generalize algorithms for the Travelling Salesman Problem by Held and Karp (J. Soc. Ind. Appl. Math. 10:196–210, 1962 ) and Gurevich and Shelah (SIAM J. Comput. 16:486–502, 1987 ). We survey a number of vertex ordering problems to which the results apply.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1432-4350
1433-0490
DOI:10.1007/s00224-011-9312-0