Reduced constants for simple cycle graph separation

Acta Informatica

Volumn 34, Issue 3, 1997, Pages 231-243

  Djidjev, Hristo N ^a   Venkatesan, Shankar M ^b  

^a Rice University   (United States)

^b University of Minnesota   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SET THEORY; THEOREM PROVING;

SEPARATOR THEOREM; VERTEX MAXIMAL PLANAR GRAPHS;

GRAPH THEORY;

EID: 0031084174     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050082     Document Type: Article

References (10)

1. L. Aleksandrov, H.N. Djidjev: Linear algorithms for partitioning embedded graphs of bounded genus. SIAM J. Discrete Math. (in print)
2. H.N. Djidjev: A separator theorem. Comptes Rendus Acad. Bulgare Sci. 34, 643-645 (1981)
3. H.N. Djidjev: On the problem of partitioning planar graphs. SIAM J. Algebra Discrete Methods 3, 229-241, (1981)
4. H.N. Djidjev: Linear algorithms for graph separation problems, SWAT'88. (Lect. Notes in Comput. Sci. vol. 318, pp. 216-221 Berlin, Heidelberg, New York: Springer 1988
5. H. Gazit: An improved algorithm for separating a planar graph (Unpublished manuscript, 1986)
6. J.R. Gilbert, J.P. Hutchinson, R.E. Tarjan: A separator theorem for graphs of bounded genus. J. Algorithms 5, 391-407, 1984
7. R.J. Lipton, R.E. Tarjan: A separator theorem for planar graphs. SIAM J. Appl. Math. 36, 177-189, 1979
8. G.L. Miller: Finding small simple cycle separators for 2-connected planar graphs. Proc. 16th Annual ACM Symp. Theory of Computing, pp. 376-382, 1984
9. G.L. Miller, S.-H. Teng, S.A. Vasasis: A unified geometric approach to graph separators. Proc 32nd FOCS, pp. 538-547, 1991
10. G.L. Miller, W. Thurston: Separators in two- and three-dimensions. Proc. 22nd Annual ACM Symp. Theory of Computing pp. 300-309 1990