Bandwidth of Bipartite Permutation Graphs in Polynomial Time

DOI10.1007/978-3-540-78773-0_19zbMath1136.05323OpenAlexW1598104667MaRDI QIDQ5458530

Daniel Meister, Dieter Kratsch, Pinar Heggernes

Publication date: 15 April 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_19

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Minimum Distortion Embeddings into a Path of Bipartite Permutation and Threshold Graphs ⋮ A note on maximum differential coloring of planar graphs ⋮ Bandwidth of Bipartite Permutation Graphs in Polynomial Time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bandwidth of chain graphs
• Bipartite permutation graphs
• The NP-completeness of the bandwidth minimization problem
• Linear discrepancy and bandwidth
• Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
• Beyond NP-completeness for problems of bounded width (extended abstract)
• The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
• Computing the Bandwidth of Interval Graphs
• The Bandwidth of Caterpillars with Hairs of Length 1 and 2
• Bandwidth Minimization: An approximation algorithm for caterpillars
• Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems
• Approximating the Bandwidth for Asteroidal Triple-Free Graphs
• Bandwidth of Bipartite Permutation Graphs in Polynomial Time
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques