Approximating bandwidth by mixing layouts of interval graphs

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

Volumn 1563, Issue , 1999, Pages 248-258

  Kratsch, Dieter ^a   Stewart, Lorna ^b  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; BANDWIDTH; FORESTRY; GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

CHORDAL GRAPHS; CIRCULAR-ARC GRAPH; CLIQUE TREE; GRAPH CLASS; INTERVAL GRAPH; PERFORMANCE RATIO; POLYNOMIAL-TIME;

TREES (MATHEMATICS);

EID: 84957047489     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49116-3_23     Document Type: Conference Paper

References (23)

1. Ando, K., A. Kaneko, S. Gervacio, The bandwidth of a tree with k leaves is at most (Formula Presented), Discrete Mathematics 150 (1996), 403-406.
2. Assmann, S. F., G.W. Peck, M. M. Sys lo and J. Zak, The bandwidth of caterpillars with hairs of length 1 and 2, SIAM J. Algebraic Discrete Methods 2 (1981), 387-393.
3. Blair, J. R. S., B. Peyton, An introduction to chordal graphs and clique trees, in Graph Theory and Sparse Matrix Computation, A. George, J. R. Gilbert, J. W. H. Liu (Eds.), The IMA Volumes in Mathematics and its Applications, Volume 56.
4. Booth, K. S. and G. S. Lueker, Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms, J. Comput. System Sci. 13 (1976), 335-379.
5. Chinn, P. Z., J. Chváatalová, A. K. Dewdney and N. E. Gibbs, The bandwidth problem for graphs and matrices|a survey, J. Graph Theory 6 (1982), 223-254.
6. Chvátalová, J., A. K. Dewdney, N. E. Gibbs and R. R. Korfhage, The bandwidth problem for graphs: a collection of recent results, Research report #24, Department of Computer Science, UWO, London, Ontario (1975).
7. Chvátal, V., A remark on a problem of Harary, Czech Math. J. 20 (1970), 109-111.
8. Corneil, D. G., S. Olariu and L. Stewart, The ultimate interval graph algorithm?, Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, 1998), 175-180.
9. Elmallah, E. S. and L. K. Stewart, Polygon graph recognition, J. Algorithms 26 (1998), 101-140.
10. 2) algorithm for circular-arc graph recognition, Proceedings of the Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Austin, TX, 1993), 128-137, ACM, New York, 1993.
11. Feige, U., Approximating the bandwidth via volume respecting embeddings, Technical Report CS98-03, Weizmann Insitute of Science, Rehovot, Israel, 1998.
12. Garey, M. R., R. L. Graham, D. S. Johnson and D. E. Knuth, Complexity results for bandwidth minimization, SIAM J. Appl. Math. 34 (1978), 477-495.
13. Gavril, F., The intersection graphs of subtrees in a tree are exactly the chordal graphs, J. Comb. Theory, Ser. B 16 (1974), 47-56.
14. Golumbic, M. C., Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
15. Jiang, S., The bandwidth problem and bandwidth of cographs, unpublished manuscript, 1992.
16. Kleitman, D. J. and R. V. Vohra, Computing the bandwidth of interval graphs, SIAM J. Discrete Math. 3 (1990), pp. 373-375.
17. Kloks, T., D. Kratsch and H. Müller, Approximating the bandwidth for asteroidal triple-free graphs, Algorithms|ESA '95 (Corfu), 434-447, Lect. Notes Comput. Sci. 979, Springer, Berlin, 1995.
18. Kloks, T., D. Kratsch and C. K. Wong, Minimum fill-in on circle and circular-arc graphs, J. Algorithms 28 (1998), 272-289.
19. Mahesh, R., C. Pandu Rangan and A. Srinivasan, On finding the minimum bandwidth of interval graphs, Inf. Comput. 95 (1991), 218-224.
20. Monien, B., The bandwidth minimization problem for caterpillars with hair length 3 is NP-complete, SIAM J. Algebraic Discrete Methods 7 (1986), 505-512.
21. Papadimitriou, C. H., The NP-completeness of the bandwidth minimization problem, Computing 16 (1976), 263-270.
22. Sprague, A. P., An O(nlog n) algorithm for bandwidth of interval graphs, SIAM J. Discrete Math. 7 (1994), 213-220.
23. Unger, W., The complexity of the approximation of the bandwidth problem, Proceedings of the Thirty-ninth Annual IEEE Symposium on Foundations of Computer Science (Palo Alto, CA, 1998).