Abstract
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 log2 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(n 2 logn)-time, 3-approximation algorithm, where n is the number of vertices.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Assmann, S.F., Peck, G.W., Sysło, M.M., Zak, J.: The Bandwidth of Caterpillars with Hairs of Length 1 and 2. SIAM Journal on Algebraic and Discrete Methods 2(4), 387–393 (1981)
Booth, K.S., Lueker, G.S.: Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-tree Algorithms. Journal of Computer and System Sciences 13(3), 335–379 (1976)
Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. Society for Industrial and Applied Mathematics, Philadelphia (1999)
Chvátal, V.: A Remark on a Problem of Harary. Czechoslovak Mathematical Journal 20(1), 109–111 (1970)
Dubey, C., Feige, U., Unger, W.: Hardness Results for Approximating the Bandwidth. J. Comput. Syst. Sci. 77, 62–90 (2011)
Heggernes, P., Kratsch, D., Meister, D.: Bandwidth of Bipartite Permutation Graphs in Polynomial Time. J. of Discrete Algorithms 7(4), 533–544 (2009)
Kloks, T., Kratsch, D., Müller, H.: Bandwidth of Chain Graphs. Inf. Process. Lett. 68(6), 313–315 (1998)
Kloks, T., Kratsch, D., Müller, H.: Approximating the Bandwidth for Asteroidal Triple-Free Graphs. Journal of Algorithms 32, 41–57 (1999)
Monien, B.: The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-complete. SIAM J. Algebraic Discrete Methods 7(4), 505–512 (1986)
Papadimitriou, C.: The NP-Completeness of the Bandwidth Minimization Problem. Computing 16, 263–270 (1976)
Shrestha, A.M.S., Tayu, S., Ueno, S.: On Orthogonal Ray Graphs. Discrete Appl. Math. 158, 1650–1659 (2010)
Spinrad, J., Brandstädt, A., Stewart, L.: Bipartite Permutation Graphs. Discrete Appl. Math. 18(3), 279–292 (1987)
Sprague, A.P.: An O(n logn) Algorithm for Bandwidth of Interval Graphs. SIAM J. Discrete Math. 7(2), 213–220 (1994)
Uehara, R.: Bandwidth of Bipartite Permutation Graphs. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol. 5369, pp. 824–835. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shrestha, A.M.S., Tayu, S., Ueno, S. (2011). Bandwidth of Convex Bipartite Graphs and Related Graphs. In: Fu, B., Du, DZ. (eds) Computing and Combinatorics. COCOON 2011. Lecture Notes in Computer Science, vol 6842. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22685-4_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-22685-4_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22684-7
Online ISBN: 978-3-642-22685-4
eBook Packages: Computer ScienceComputer Science (R0)