Bandwidth of Bipartite Permutation Graphs

DOI10.1007/978-3-540-92182-0_72MaRDI QIDQ3597883zbMATH OpenOpenAlexFDO

Authors 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

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)

Recommendations

• Bandwidth of bipartite permutation graphs in polynomial time
• Bandwidth of Bipartite Permutation Graphs in Polynomial Time
• scientific article; zbMATH DE number 1696538
• Bandwidth of convex bipartite graphs and related graphs
• Bandwidth of convex bipartite graphs and related graphs

Cited in

(17)

• Classification of bipartite permutation matrices under local permutation equivalence
• Bandwidth of convex bipartite graphs and related graphs
• Bandwidth of bipartite permutation graphs in polynomial time
• scientific article; zbMATH DE number 4047762 (Why is no real title available?)
• Subgraph isomorphism in graph classes
• Bandwidth of convex bipartite graphs and related graphs
• scientific article; zbMATH DE number 3974992 (Why is no real title available?)
• Tractabilities and intractabilities on geometric intersection graphs
• scientific article; zbMATH DE number 1696538 (Why is no real title available?)
• Finding the minimum bandwidth of an interval graph
• Bandwidth and density for block graphs
• Bandwidth of Bipartite Permutation Graphs in Polynomial Time
• Bandwidth on AT-free graphs
• Undecidability of the bandwidth problem on linear graph languages
• scientific article; zbMATH DE number 4075107 (Why is no real title available?)
• 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)