Finding separator cuts in planar graphs within twice the optimal

SIAM Journal on Computing

Volumn 29, Issue 1, 1999, Pages 159-179

  Garg, Naveen ^a   Saran, Huzur ^a   Vazirani, Vijay V ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

^b Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; ITERATIVE METHODS; PROBLEM SOLVING;

PLANAR GRAPHS; PSEUDOAPPROXIMATION ALGORITHMS;

GRAPH THEORY;

EID: 0343603623     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794271692     Document Type: Article

References (9)

1. S. N. BHATT AND F. T. LEIGHTON, A framework for solving VLSI graph layout problems, J. Comput. System Sci., 28 (1984), pp. 300-343.
2. P. W. KASTELEYN, Dimer statistics and phase transitions, J. Math. Phys., 4 (1963), pp. 287-293.
3. F. T. LEIGHTON AND S. RAO An approximate max-flow min-cut theorem for uniform multicommodity flow problems with application to approximation algorithms, in Proceedings, 29th Annual IEEE Symposium on Foundations of Computer Science, 1988, pp. 422-431.
4. C. E. LEISERSON, Area-efficient layouts (for VLSI), in Proceedings, 21st Annual IEEE Symposium on Foundations of Computer Science, 1980.
5. R. J. LIPTON AND R. E. TARJAN, A separator theorem for planar graphs, SIAM J. Appl. Math., 36 (1979), pp. 177-189.
6. R. J. LIPTON AND R. E. TARJAN, Applications of a planar separator theorem, SIAM J. Comput., 9 (1980), pp. 615-627.
7. J. K. PARK AND C. A. PHILLIPS, Finding minimum-quotient cuts in planar graphs, in Proceedings, 25th Annual ACM Symposium on Theory of Computing, 1993, pp. 766-775.
8. S. B. RAO, Finding near optimal separators in planar graphs, in Proceedings, 28th Annual IEEE Symposium on Foundations of Computer Science, 1987, pp. 225-237.
9. S. B. RAO, Faster algorithms for finding small edge cuts in planar graphs, in Proceedings, 24th Annual ACM Symposium on Theory of Computing, 1992, pp. 229-240.