Blar i Faculty of Mathematics and Natural Sciences på emneord "Exponential time algorithms"
Viser treff 1-1 av 1
-
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
(Peer reviewed; Journal article, 2011-01-21)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 ...