Now showing items 1-3 of 3

  • Computation of Treespan. A Generalization of Bandwidth to Treelike Structures 

    Dregi, Markus Sortland (The University of Bergen, 2012-06-14)
    Motivated by a search game, Fomin, Heggernes and Telle [Algorithmica, 2005] defined the graph parameter treespan, a generalization of the well studied parameter bandwidth. Treespan is the maximum number of appearances ...
  • 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 ...
  • A polynomial-time solvable case for the NP-hard problem Cutwidth 

    Lilleeng, Simen (The University of Bergen, 2014-06-02)
    The Cutwidth problem is a notoriously hard problem, and its complexity is open on several interesting graph classes. Motivated by this fact we investigate the problem on superfragile graphs, a graph class on which the ...