Graph searching, elimination trees, and a generalization of bandwidth

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

Volumn 2751, Issue , 2003, Pages 73-85

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

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COMPUTATION THEORY; MATRIX ALGEBRA;

ALGORITHMIC PROPERTIES; BANDWIDTH MINIMIZATION PROBLEM; ELIMINATION TREE; GRAPH PARAMETERS; GRAPH SEARCHING; PATH DECOMPOSITION; SPARSE MATRIX COMPUTATIONS; TREE DECOMPOSITION;

TREES (MATHEMATICS);

EID: 33748114756     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45077-1_8     Document Type: Article

References (23)

1. S. ARNBORG, D.G. CORNEIL, AND A. PROSKUROWSKI, Complexity of finding embeddings in a k-tree, SIAM J. Alg. Disc. Meth., 8 (1987), pp. 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. Alg. Disc. Meth., 2 (1981), pp. 387-392.
3. D. BIENSTOCK, Graph searching, path-width, tree-width and related problems (a survey), DIMACS Ser. in Discrete Mathematics and Theoretical Computer Science, 5 (1991), pp. 33-49.
4. D. BIENSTOCK AND P. SEYMOUR, Monotonicity in graph searching, J. Algorithms, 12 (1991), pp. 239-245.
5. H.L. BODLAENDER, A partial k-arboretum of graphs with bounded treewidth, Theor. Comp. Sc., 209 (1998), pp. 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), pp. 223-254.
7. N.D. DENDRIS, L.M. KIROUSIS, AND D.M. THILIKOS, Fugitive-search games on graphs and related parameters, Theor. Comp. Sc., 172 (1997), pp. 233-254.
8. J.A. ELLIS, I.H. SUDBOROUGH, AND J. TURNER, The vertex separation and search number of a graph, Information and Computation, 113 (1994), pp. 50-79.
9. F. FOMIN, Helicopter search problems, bandwidth and pathwidth, Discrete Appl. Math., 85 (1998), pp. 59-71.
10. F.V. FOMIN AND P.A. GOLOVACH, Graph searching and interval completion, SIAM J. Discrete Math., 13 (2000), pp. 454-464 (electronic).
11. M. FRANKLIN, Z. GALIL, AND M. YUNG, Eavesdropping games: A graph-theoretic approach to privacy in distributed systems, J. ACM, 47 (2000), pp. 225-243.
12. D. FULKERSON AND O. GROSS, Incidence matrices and interval graphs, Pacific Journal of Math., 15 (1965), pp. 835-855.
13. M.R. GAREY, R.L. GRAHAM, D.S. JOHNSON, AND D.E. KNUTH, Complexity results for bandwidth minimization, SIAM J. Appl. Math., 34 (1978), pp. 477-495.
14. F. GAVRIL, The intersection graphs of subtrees in trees are exactly the chordal graphs, J. Combin. Theory Ser. B, 16 (1974), pp. 47-56.
15. L.M. KIROUSIS AND C.H. PAPADIMITRIOU, Searching and pebbling, Theor. Comp. Sc., 47 (1986), pp. 205-218.
16. A.S. LAPAUGH, Recontamination does not help to search a graph, J. ACM, 40 (1993), pp. 224-245.
17. 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), pp. 45-64.
18. P.S. MAKEDON, C.H. PAPADIMITRIOU, AND I.H. SUDBOROUGH, Topological bandwidth, SIAM J. Alg. Disc. Meth., 6 (1985), pp. 418-444.
19. F.S. MAKEDON AND I.H. SUDBOROUGH, On minimizing width in linear layouts, Disc. Appl. Math., 23 (1989), pp. 201-298.
20. A. PARRA AND P. SCHEFFLER, Treewidth equals bandwidth for AT-free claw-free graphs, Technical Report 436/1995, Technische Universität Berlin, Fachbereich Mathematik, Berlin, Germany, 1995.
21. F.S. ROBERTS, Indifference graphs, in Proof Techniques in Graph Theory, F. Harary, ed., Academic Press, 1969, pp. 139-146.
22. N. ROBERTSON AND P.D. SEYMOUR, Graph minors - a survey, in Surveys in Combinatorics, I. Anderson, ed., Cambridge Univ. Press, 1985, pp. 153-171.
23. A.L. ROSENBERG AND I.H. SUDBOROUGH, Bandwidth and pebbling, Computing, 31 (1983), pp. 115-139.