Finding approximate separators and computing tree width quickiy

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 221-228

  Reed, Bruce A ^a,b  

^a UNIVERSITY OF BONN   (Germany)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTERING ALGORITHMS; COMPUTATION THEORY; FORESTRY; GRAPH THEORY; SEPARATORS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; TREES (MATHEMATICS);

CUT-SET; GRAPH G; LINEAR-TIME ALGORITHMS; TREE DECOMPOSITION; TREE-WIDTH;

TREES (MATHEMATICS); ALGORITHMS;

APPROXIMATE SEPARATORS; TREE DECOMPOSITION; TREE WIDTH;

EID: 0026979104     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129734     Document Type: Conference Paper

References (34)

1. Aho, Hopcroft and Ullman: Design and Analysis of Computer Algorithms, Addison-Wesley, Reading MA 1972.
2. N. Alon, P. Seymour and R. Thomas: A Separator Theorem for Graphs with an Excluded Minor and its Applications, Proc. 22nd STOC (1990), 293-299.
3. S. Arnborg, Jens Lagergren and Detlef Seese: Easy Problems for Tree-Decomposable Graphs, J. of Algorithms 12 (1991), 308-340.
4. S. Arnborg and J. Lagergren: Finding Minimal Mionrs Using A Finite Congruence, Proc. 18th ICALP(1991), 544-555.
5. S. Arnborg: Efficient algorithms for combinatorial problems on graphs with bounded decompos-ability - A survey, BIT 25 (1985), 2-33.
6. S. Arnborg, D.G. Corneil and A. Proskurowski: Complexity of finding embeddings in a fc-tree, SIAM J. Algebra Discrete Methods 8 (1987), 277-284.
7. S. Arnborg and A. Proskurowski: Characterization and recognition of partial 3-trees, SIAM J. Algebra Discrete Methods 7 (1986), 305-314.
8. S. Arnborg and A. Proskurowski: Linear Time algorithms for NP-hard problems on graphs embedded in Jfe-trees, Discrete Appi Math. 23 (1989), 11-24.
9. D. Bienstock and Paul Seymour: Monotonicity in Graph Searching, /. of Algorithms 12 (1991), 239-245.
10. D. Bienstock, N. Robertson, Paul Seymour and R. Thomas: Quickly excluding a forest, J. Combin. Theory. Ser. B 52 (1991), 274-283.
11. H.L. Bodlaender: Dynamic Programming on Graphs with Bounded Tree-width, MIT/LCS/TR-394, MIT, 1987.
12. H.L. Bodlaender: NC-Algorithms for Graphs with Bounded Tree-width, RUU-CS-88-4, University of Utrecht, 1988.
13. H.L. Bodlaender: Improved Self-reduction Algorithms from Graphs with Bounded Tree-width, RUU-CS-88-29, University of Utrecht, 1988.
14. H.L. Bodlaender: Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial fc-trees, J. of Algorithms 11 (1990), 631-643.
15. H. Bodlaender and T. Kloks: Better Algorithms For Path Width And Tree Width, Proc. 18th ICALP(1991), 533-543.
16. R.L. Breisch: An intuitive approach to speleotopology, Southwestern Cavers (published by the Southwestern Region of the National Speleological Society) 6, No.5 (1967), 72-78.
17. B. Courcelle: Recognizability and second-order definability for sets of finite graphs, preprint, Université de Bordeaux, 1-8634, Jan. 1987. See also Information and Comput. 85 (1990), 12-75.
18. B. Courcelle: The Monadic Second Order Logic of Graphs. III. Tree-width, Forbidden Minors, and Complexity Issues, Université de Bordeaux, Report 1-8852, 1988.
19. J.R. Gilbert, J.P. Hutchinson and R.E. Tarjan : A separator theorem for graphs of bounded genus, J. of Algorithms 5 (1984), 391-407.
20. M. Golumbic: Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
21. S.T. Hedetniemi: Open problems concerning the theory of algorithms on partial jfe-trees, working paper, 1987.
22. L.M. Kirousis and C.H. Papadimitriou: Searching and pebbling, /. Theoret. Comput. Sci. 47 (1986), 205-218.
23. L.M. Kirousis and C.H. Papadimitriou: Interval graphs and searching, Discrete Math 55 (1985), 181-184.
24. A. Lapaugh: Recontamination does not help to search a graph, Tech. Report 335, Dept. of Elee. Eng. and Comput. Sci., Princeton University, 1982.
25. R.J. Lipton and R.E. Tarjan: A separator theorem for planar graphs, SIAM J. Appi. Math. 36 (1979), 177-189.
26. R.J. Lipton and R.E. Tarjan: Applications of a planar separator theorem, Proc. 18th. FOCS (1977), 162-170.
27. R.J. Lipton and R.E. Tarjan: Applications of a planar separator theorem, SIAM J. Comput. 9 (1980), 615-627.
28. J. Matousek and R. Thomas: On the complexity of finding iso-and other morphisms for partial fc-trees, unpublished paper, 1988.
29. T.D. Parsons: Pursuit-evasion in a graph, in: Theory and Application of graphs (Y. Alavi and D.R. Lick, Eds.), New York/Berlin, pp. 426-441, Springer Verlag, 1976.
30. N. Robertson and P.D. Seymour: Graph minors. II. Algorithmic aspects of tree-width, J. Algorithms 7 (1986), 309-322.
31. N. Robertson and P.D. Seymour: Graph minors X. Obstructions to tree decomposition, J. Combin. Theory Ser. B 52 (1991), 153-190.
32. N. Robertson and P.D. Seymour: Graph minors XIII, The disjoint path problem, preprint, Sept. 1986.
33. P.D. Seymour and R. Thomas: Graph searching, and a minimax theorem for tree-width, submitted (manuscript 1988).
34. P. Schemer: Linear-time algorithms for NP-complete problems restricted to partial Jfc-trees, preprint AdW, R-Math-03/87, Karl- Weierstraß Inst, für Math., Berlin, 1987.