Faster algorithms for finding small edge cuts in planar graphs

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129722, Issue , 1992, Pages 229-240

  Rao, Satish B ^a  

^a NEC LABORATORIES AMERICA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; COSTS; GRAPHIC METHODS; SEPARATORS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; OPTIMIZATION;

EDGE CUTS; EDGE SEPARATION; EDGE-SEPARATOR; OPTIMAL SOLUTIONS; PLANAR GRAPH; RUNNING TIME; SIMPLE ALGORITHM;

GRAPH THEORY; ALGORITHMS;

BALANCE OF A CUT; EDGE SEPARATORS; GRAPH FLUX; NODE SEPARATORS; PLANAR GRAPHS; QUOTIENT COST; SMALL EDGE CUTS;

EID: 0026999433     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/129712.129735     Document Type: Conference Paper

References (18)

1. B. Awerbuch, B. Berger, L. Cowen, and D. Peleg. Fast constructions of sparse neighborhood covers. Unpublished Manuscript.
2. B. Awerbuch and D. Peleg. Sparse partitions. In 31st Symposium on Foundations of Computer Science, pages 503-513, 1990.
3. S.N. Bhatt and F.T. Leighton. A framework for solving VLSI graph layout problems. Journal of Computer and System Sciences, 28(2), 1984.
4. S. Even. Graph Algorithms. Computer Science Press, 1979.
5. G. N. Fredrickson and R. Janardan. Separator-based startegies for efficient message routing. In 27th Annual Symposium on Foundations of Computer Science, IEEE, pages 428-437, 1986.
6. M.R. Garey, D.S. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, pages 237-267, 1976.
7. D. Johnson and S. Venkatesan. Partition of planar flow networks. In 24th Annual Symposium on Foundations of Computer Science, IEEE, pages 259-263, 1983.
8. P. Klein, S. Plotkin, C. Stein, and E. Tardos. Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, pages 310321, May 1990.
9. F. T. Leighton and Satish Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In 28th Annual Symposium on Foundations of Computer Science, IEEE, pages 256-269, 1988.
10. F.T. Leighton, F. Makedon, S. Plotkin, C. Stein, E. Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pages 101-111, May 1991.
11. O.E. Leiserson. Area-efficient layouts (for VLSI). In Proceedings of the 21ts Annual Symposium on Foundations of Computer Science, October 1980.
12. R.J. Lipton and R.E. Tarjan. Applications of a planar separator theorem. SIAM Journal on Computing, 36(2):177-189, April 1979.
13. R.J. Lipton and R.E. Tarjan. A separator theorem for planar graphs. SIAM Journal of Applied Mathematics, 8(2):177-189, April 1979.
14. N. Meggido. Combinatorial optimization with rational objective functions. Mathematics of Operations Research, 4(4):414-424, November 1979.
15. G. Miller. Finding small simple cycle separators for 2-connected planar graphs. Journal of Computer and System Sciences, pages 265-279, June 1986.
16. G. Miller and H. Gazit. A parallel algorithm for finding a separator in planar graphs. In Proceedings of the 88th Annual Symposium on Foundations of Computer Science, pages 238-248, 1987.
17. S. Rao. Finding near optimal separators in planar graphs. In 58th Annual Symposium on Foundations of Computer Science, IEEE, page 225, 1987.
18. F. Shahrokhi and D.W. Matula. The maximum concurrent flow problem. Journal of the ACM, 37:318-334, 1990.