Abstract
We give the first polynomial-time algorithm that computes the bandwidth of bipartite permutation graphs. Prior to our work, polynomial-time algorithms for exact computation of bandwidth were known only for caterpillars of hair length 2, chain graphs, cographs, and interval graphs.
This work is supported by the Research Council of Norway through grant 166429/V30. In this extended abstract most proofs are omitted; they can be found in a technical report [12].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
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 J. Algebraic and Discrete Methods 2, 387–393 (1981)
Blache, G., Karpinski, M., Wirtgen, J.: On approximation intractability of the bandwidth problem. Technical report, University of Bonn (1997)
Blum, A., Konjevod, G., Ravi, R., Vempala, S.: Semi-Definite Relaxations for Minimum Bandwidth and other Vertex-Ordering Problems. In: Proceedings of STOC 1998, pp. 100–105. ACM, New York (1998)
Bodlaender, H.L., Fellows, M.R., Hallet, M.T.: Beyond NP-completeness for problems of bounded width (extended abstract): hardness for the W hierarchy. In: Proceedings of STOC 1994, pp. 449–458. ACM, New York (1994)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)
Feige, U.: Approximating the Bandwidth via Volume Respecting Embeddings. In: Proceedings of STOC 1998, pp. 90–99. ACM, New York (1998)
Feige, U., Talwar, K.: Approximating the Bandwidth of Caterpillars. In: Chekuri, C., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) APPROX 2005 and RANDOM 2005. LNCS, vol. 3624, pp. 62–73. Springer, Heidelberg (2005)
Fishburn, P., Tanenbaum, P., Trenk, A.: Linear discrepancy and bandwidth. Order 18, 237–245 (2001)
George, J.A., Liu, J.W.H.: Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall Inc., Englewood Cliffs, New Jersey (1981)
Gupta, A.: Improved bandwidth approximation for trees. In: Proceedings of SODA 2000, pp. 788–793. ACM, SIAM (2000)
Haralambides, J., Makedon, F., Monien, B.: Bandwidth Minimization: An Approximation Algorithm for Caterpillars. Mathematical Systems Theory 24(3), 169–177 (1991)
Heggernes, P., Kratsch, D., Meister, D.: Bandwidth of bipartite permutation graphs in polynomial time. In: Reports in Informatics, University of Bergen, Norway, vol. 356 (2007)
Kleitman, D.J., Vohra, R.V.: Computing the bandwidth of interval graphs. SIAM J. Disc. Math. 3, 373–375 (1990)
Kloks, T., Kratsch, D., Müller, H.: Bandwidth of chain graphs. Information Processing Letters 68, 313–315 (1998)
Kloks, T., Kratsch, D., Müller, H.: Approximating the bandwidth for AT-free graphs. Journal of Algorithms 32, 41–57 (1999)
Meister, D.: Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs. Disc. Appl. Math. 146, 193–218 (2005)
Monien, B.: The bandwidth minimization problem with hair length 3 is NP-complete. SIAM J. Alg. Disc. Meth. 7, 505–512 (1986)
Papadimitriou, C.: The NP-completeness of the bandwidth minimization problem. Computing 16, 263–270 (1976)
Spinrad, J., Brandstädt, A., Stewart, L.: Bipartite permutation graphs. Disc. Appl. Math. 18, 279–292 (1987)
Unger, W.: The Complexity of the Approximation of the Bandwidth Problem. In: Proceedings of FOCS 1998, pp. 82–91. IEEE, Los Alamitos (1998)
Yan, J.H.: The bandwidth problem in cographs. Tamsui Oxf. J. Math. Sci. 13, 31–36 (1997)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heggernes, P., Kratsch, D., Meister, D. (2008). Bandwidth of Bipartite Permutation Graphs in Polynomial Time. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds) LATIN 2008: Theoretical Informatics. LATIN 2008. Lecture Notes in Computer Science, vol 4957. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78773-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-78773-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78772-3
Online ISBN: 978-3-540-78773-0
eBook Packages: Computer ScienceComputer Science (R0)