📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time

First Author: Heggernes P

Attributed to: Exact algorithms for NP-hard problems funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-16926-7_9

Publication URI: http://dx.doi.org/10.1007/978-3-642-16926-7_9

Type: Book Chapter

Book Title: Graph Theoretic Concepts in Computer Science (2010)

Page Reference: 75-87