Bandwidth of Bipartite Permutation Graphs

DOI10.1007/978-3-540-92182-0_72zbMath1183.68316OpenAlexW48264608MaRDI QIDQ3597883

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

bandwidthchain graphsinterval graphsthreshold graphsbipartite permutation graphs

Mathematics Subject Classification ID

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

Related Items (3)

Bandwidth of convex bipartite graphs and related graphs ⋮ Subgraph isomorphism in graph classes ⋮ Tractabilities and intractabilities on geometric intersection graphs

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