Now showing items 1-1 of 1

  • A Note on Exact Algorithms for Vertex Ordering Problems on Graphs 

    Bodlaender, Hans L.; Fomin, Fedor V.; Koster, Arie M.C.A.; Kratsch, Dieter; Thilikos, Dimitrios M. (Springer, 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 ...