Bandwidth of Bipartite Permutation Graphs

DOI10.1007/978-3-540-92182-0_72zbMATH Open1183.68316OpenAlexW48264608MaRDI QIDQ3597883FDOQ3597883

Ryuhei Uehara

Publication date: 29 January 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

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

Recommendations

• Bandwidth of bipartite permutation graphs in polynomial time
• Bandwidth of Bipartite Permutation Graphs in Polynomial Time
• Publication:2766686
• Bandwidth of convex bipartite graphs and related graphs
• Bandwidth of convex bipartite graphs and related graphs

zbMATH Keywords

bandwidthinterval graphschain graphsthreshold graphsbipartite permutation graphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (14)

• Title not available (Why is that?)
• Bandwidth of bipartite permutation graphs in polynomial time
• Subgraph isomorphism in graph classes
• Bandwidth of convex bipartite graphs and related graphs
• Title not available (Why is that?)
• Tractabilities and intractabilities on geometric intersection graphs
• Title not available (Why is that?)
• Finding the minimum bandwidth of an interval graph
• Bandwidth and density for block graphs
• Bandwidth on AT-free graphs
• Title not available (Why is that?)
• Undecidability of the bandwidth problem on linear graph languages
• A simple linear-time algorithm for the recognition of bandwidth-2 biconnected graphs
• Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem

This page was built for publication: Bandwidth of Bipartite Permutation Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3597883)