Bandwidth of chain graphs

Information Processing Letters

Volumn 68, Issue 6, 1998, Pages 313-315

  Kloks, Ton ^a   Kratsch, Dieter ^b   Müller, Haiko ^b  

^a CHARLES UNIVERSITY   (Czech Republic)

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Algorithms; Bandwidth; Chain graphs; Graph algorithms

Indexed keywords

ALGORITHMS; BANDWIDTH; SET THEORY;

CHAIN GRAPHS; GRAPH ALGORITHMS;

GRAPH THEORY;

EID: 0032310104     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00173-2     Document Type: Article

References (13)

1. S.F. Assmann, G.W. Peck, M. Sysło, J. Zak, The bandwidth of caterpillars with hairs of length 1 and 2, SIAM J. Algebraic Discrete Methods 2 (1981) 387-393.
2. H. Bodlaender, M.R. Fellows, M.T. Hallet, Beyond NP-completeness for problems of bounded width: Hardness for the W hierarchy, in: Proc. 26th STOC, 1994, pp. 449-458.
3. M.R. Garey, R.L. Graham, D.S. Johnson, D.E. Knuth, Complexity results for bandwidth minimization, SIAM J. Appl. Math. 34 (1978) 477-495.
4. M.C. Golumbic, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
5. E. Gurari, I.H. Sudborough, Improved dynamic programming algorithms for the bandwidth minimization and the mincut linear arrangement problem, J. Algorithms 5 (1984) 531-546.
6. H. Kaplan, R. Shamir, Pathwidth, bandwidth and completion problems to proper interval graphs with small cliques, SIAM J. Computing 25 (1996) 540-561.
7. D.J. Kleitman, R.V. Vohra, Computing the bandwidth of interval graphs, SIAM J. Discrete Math. 3 (1990) 373-375.
8. C.E. Lekkerkerker, J.C. Boland, Representation of a finite graph by a set of intervals on a real line, Fund. Math. 51 (1962) 45-64.
9. B. Monien, The bandwidth minimization problem for caterpillars with hairs of length 3 is NP-complete, SIAM J. Algebraic Discrete Methods 7 (1986) 505-512.
10. C.H. Papadimitriou, The NP-completeness of the bandwidth minimization problem, Computing 16 (1976) 263-270.
11. G.W. Peck, A. Shastri, Bandwidth of theta graphs with short paths, Discrete Math. 103 (1992) 177-187.
12. A.P. Sprague, An O(n log n) algorithm for bandwidth of interval graphs, SIAM J. Discrete Math. 7 (1994) 213-220.
13. M. Yannakakis, Node deletion problems on bipartite graphs, SIAM J. Comput. 10 (1981) 310-327.