Bandwidth of Convex Bipartite Graphs and Related Graphs
From MaRDI portal
Publication:3087959
DOI10.1007/978-3-642-22685-4_28zbMath1353.68304OpenAlexW142420440MaRDI QIDQ3087959
Anish Man Singh Shrestha, Shuichi Ueno, Satoshi Tayu
Publication date: 17 August 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-22685-4_28
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (2)
An exponential time 2-approximation algorithm for bandwidth ⋮ Tractabilities and intractabilities on geometric intersection graphs
This page was built for publication: Bandwidth of Convex Bipartite Graphs and Related Graphs