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.
Pathwidth can be computed in O * (2 n )-time (in O * (2 n ) space) or in O * (4 n )-time with the use of polynomial space, using a simple algorithm from REF .
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
Theory of Computing Systems
Theory of Computing Systems
Mathematics Computer Science