Graph searching, elimination trees, and a generalization of bandwidth

Algorithmica (New York)

Volumn 41, Issue 2, 2004, Pages 73-87

  Fomin, Fedor V ^a   Heggernes, Pinar ^a   Telle, Jan Arne ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

Bandwidth; Chordal graph; Elimination tree; Graph searching; Tree decomposition

Indexed keywords

BANDWIDTH; COMPUTATIONAL METHODS; GAME THEORY; OPTIMIZATION; PROBLEM SOLVING; SWITCHING THEORY; THEOREM PROVING; TOPOLOGY; TREES (MATHEMATICS);

CHORDAL GRAPH; ELIMINATION TREE; GRAPH SEARCHING; TREE DECOMPOSITION;

GRAPH THEORY;

EID: 10844294206     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1117-y     Document Type: Article

References (28)

1. S. Arnborg, D. G. Corneil, and A. Proskurowski, Complexity of finding embeddings in a k-tree, SIAM J. Algebraic Discrete Methods, 8 (1987), 277-284.
2. S. F. Assman, G. W. Peck, M. M. Syslo, and J. Zak, The bandwidth of caterpillars with hairs of length 1 and 2, SIAM J. Algebraic Discrete Methods, 2 (1981), 387-392.
3. D. Bienstock, Graph Searching, Path-Width, Tree-Width and Related Problems (a Survey), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 5, American Mathematical Society, Providence, RI, 1991, pp. 33-49.
4. D. Bienstock and P. Seymour, Monotonicity in graph searching, J. Algorithms, 12 (1991), 239-245.
5. H. L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoret. Comput. Sci., 209 (1998), 1-45.
6. P. Z. Chinn, J. Chvátalová, A. K. Dewdney, and N. E. Gibbs, The bandwidth problem for graphs and matrices - a survey, J. Graph Theory, 6 (1982), 223-254.
7. N. D. Dendris, L. M. Kirousis, and D. M. Thilikos, Fugitive-search games on graphs and related parameters, Theoret. Comput. Sci., 172 (1997), 233-254.
8. J. A. Ellis, I. H. Sudborough, and J. Turner, The vertex separation and search number of a graph, Inform. and Comput. 113 (1994), 50-79.
9. F. Fomin, Helicopter search problems, bandwidth and pathwidth, Discrete Appl. Math., 85 (1998), 59-71.
10. F. V. Fomin and P. A. Golovach, Graph searching and interval completion, SIAM J. Discrete Math., 13 (2000), 454-464.
11. F. V Fomin, Y. Stamatiou, and D.M. Thilikos, Unpublished results.
12. F. V Fomin and D. M. Thilikos, On the monotonicity of games generated by symmetric submodular functions, Discrete Appl. Math., 131(2) (2003), 323-335.
13. M. Franklin, Z. Galil, and M. Yung, Eavesdropping games: a graph-theoretic approach to privacy in distributed systems, J. ACM, 47 (2000), 225-243.
14. D. Fulkerson and O. Gross, Incidence matrices and interval graphs, Pacific J. Math., 15 (1965), 835-855.
15. M. R. Garey, R. L. Graham, D. S. Johnson, and D. E. Knuth, Complexity results for bandwidth minimization, SIAM J. Appl. Math., 34 (1978), 477-495.
16. F. Gavril, The intersection graphs of subtrees in trees are exactly the chordal graphs, J. Combin. Theory Ser. B, 16 (1974), 47-56.
17. L. M. Kirousis and C. H. Papadimitriou, Searching and pebbling, Theoret. Comput. Sci., 47 (1986), 205-218.
18. A. S. LaPaugh, Recontamination does not help to search a graph, J. ACM, 40 (1993), 224-245.
19. C. G. Lekkerkerker and J. C. Boland, Representation of a finite graph by a set of intervals on the real line, Fund. Math., 51 (1962), 45-64.
20. J. W. H. Liu, A compact row storage scheme for Cholesky factors using elimination trees, ACM Trans. Math. Software, 12 (1986), 127-148.
21. J. W. H. Liu, The role of elimination trees in sparse factorization, SIAM J. Matrix Anal. Appl., 11 (1990), 134-172.
22. F. S. Makedon, C. H. Papadimitriou, and I. H. Sudborough, Topological bandwidth, SIAM J. Algebraic Discrete Methods, 6 (1985), 418-444.
23. F. S. Makedon and I. H. Sudborough, On minimizing width in linear layouts, Discrete Appl. Math., 23 (1989), 201-298.
24. A. Parra and P. Scheffler, Treewidth equals bandwidth for AT-free claw-free graphs, Technical Report 436/1995, Fachbereich Mathematik, Technische Universität Berlin, Berlin, 1995.
25. F. S. Roberts, Indifference graphs, in Proof Techniques in Graph Theory, F. Harary, ed., Academic Press, New York, 1969, pp. 139-146.
26. N. Robertson and P. D. Seymour, Graph minors - a survey, in Surveys in Combinatorics, I. Anderson, ed., Cambridge University Press, Cambridge, 1985, pp. 153-171.
27. A. L. Rosenberg and I. H. Sudborough, Bandwidth and pebbling, Computing, 31 (1983), 115-139.
28. R. Schreiber, A new implementation of sparse Gaussian elimination, ACM Trans. Math. Software, 8 (1982), 256-276.