Bandwidth of bipartite permutation graphs in polynomial time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4957 LNCS, Issue , 2008, Pages 216-227

  Heggernes, Pinar ^a   Kratsch, Dieter ^b   Meister, Daniel ^a  

^a UNIVERSITY OF BERGEN   (Norway)

^b UNIVERSITÉ DE LORRAINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTATIONAL METHODS; POLYNOMIALS; MATHEMATICAL TRANSFORMATIONS; POLYNOMIAL APPROXIMATION; TELECOMMUNICATION SYSTEMS;

BIPARTITE PERMUTATION GRAPHS; INTERVAL GRAPHS; POLYNOMIAL-TIME ALGORITHMS; CO-GRAPHS; EXACT COMPUTATIONS; INFORMATICS; LATIN AMERICAN; POLYNOMIAL-TIME;

GRAPH THEORY;

EID: 43049143530     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78773-0_19     Document Type: Conference Paper

References (21)

1. Assmann, S.F., Peck, G.W., Syslo, 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)
2. Blache, G., Karpinski, M., Wirtgen, J.: On approximation intractability of the bandwidth problem. Technical report, University of Bonn (1997)
3. 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)
4. 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)
5. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)
6. Feige, U.: Approximating the Bandwidth via Volume Respecting Embeddings. In: Proceedings of STOC 1998, pp. 90-99. ACM, New York (1998)
7. 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)
8. Fishburn, P., Tanenbaum, P., Trenk, A.: Linear discrepancy and bandwidth. Order 18, 237-245 (2001)
9. George, J.A., Liu, J.W.H.: Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall Inc., Englewood Cliffs, New Jersey (1981)
10. Gupta, A.: Improved bandwidth approximation for trees. In: Proceedings of SODA 2000, pp. 788 793, ACM, SIAM (2000)
11. Haralambides, J., Makedon, F., Monien, B.: Bandwidth Minimization: An Approximation Algorithm for Caterpillars. Mathematical Systems Theory 24(3), 169-177 (1991)
12. 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)
13. Kleitman, D.J., Vohra, R.V.: Computing the bandwidth of interval graphs. SIAM J. Disc. Math. 3, 373-375 (1990)
14. Kloks, T., Kratsch, D., Müller, H.: Bandwidth of chain graphs. Information Processing Letters 68, 313-315 (1998)
15. Kloks, T., Kratsch, D., Müller, H.: Approximating the bandwidth for AT-free graphs. Journal of Algorithms 32, 41-57 (1999)
16. Meister, D.: Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs. Disc. Appl. Math. 146, 193-218 (2005)
17. Monien, B.: The bandwidth minimization problem with hair length 3 is NP-complete. SIAM J. Alg. Disc. Meth. 7, 505-512 (1986)
18. Papadimitriou, C.: The NP-completeness of the bandwidth minimization problem. Computing 16, 263-270 (1976)
19. Spinrad, J., Brandstadt, A., Stewart, L.: Bipartite permutation graphs. Disc. Appl. Math. 18, 279-292 (1987)
20. Unger, W.: The Complexity of the Approximation of the Bandwidth Problem. In: Proceedings of FOCS 1998, pp. 82-91. IEEE, Los Alamitos (1998)
21. Yan, J.H.: The bandwidth problem, in cographs. Tamsui Oxf. J. Math. Sci. 13, 3136 (1997)