A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
Peer reviewed, Journal article
MetadataShow full item record
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.
CopyrightThe Author(s) 2011
Copyright The Author(s) 2011. This article is published with open access at Springerlink.com