It is known that the bandwidth problem is NP-complete for chordal bipartite graphs, while the problem can be solved in polynomial time for bipartite permutation graphs, which is a subclass of chordal bipartite graphs. This paper shows that the problem is NP-complete even for convex bipartite graphs, a subclass of chordal bipartite graphs and a superclass of bipartite permutation graphs. We provide an O(n)-time, 4-approximation algorithm and an O(n log 2 n)-time, 2-approximation algorithm for convex bipartite graphs with n vertices. For 2-directional orthogonal ray graphs, which is a subclass of chordal bipartite graphs and a superclass of convex bipartite graphs, we provide an O(n2 logn)-time, 3-approximation algorithm, where n is the number of vertices. © 2011 Springer-Verlag.
CITATION STYLE
Shrestha, A. M. S., Tayu, S., & Ueno, S. (2011). Bandwidth of convex bipartite graphs and related graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6842 LNCS, pp. 307–318). https://doi.org/10.1007/978-3-642-22685-4_28
Mendeley helps you to discover research relevant for your work.