Computing the Cutwidth of Bipartite Permutation Graphs in Linear Time
From MaRDI portal
Publication:3057614
DOI10.1007/978-3-642-16926-7_9zbMath1310.05199MaRDI QIDQ3057614
Pinar Heggernes, Daniel Lokshtanov, Jesper Nederlof, Pim van 't Hof
Publication date: 16 November 2010
Published in: Graph Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-16926-7_9
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
05C85: Graph algorithms (graph-theoretic aspects)