A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth

Dimitrios M. Thilikos, Maria J. Serna, Hans Leo Bodlaender. A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth. In Friedhelm Meyer auf der Heide, editor, Algorithms - ESA 2001, 9th Annual European Symposium, Aarhus, Denmark, August 28-31, 2001, Proceedings. Volume 2161 of Lecture Notes in Computer Science, pages 380-390, Springer, 2001. [doi]

Abstract

Abstract is missing.