Partitioning planar graphs with vertex costs: Algorithms and applications

Algorithmica (New York)

Volumn 28, Issue 1, 2000, Pages 51-75

  Djidjev, H N ^a  

^a Rice University   (United States)

Author keywords

Divide and conquer; Graph embeddings; Graph separators; Multicommodity flow; Pebbling

Indexed keywords

EID: 8844271767     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010031     Document Type: Article

References (29)

1. N. Alon, P. Seymour, and R. Thomas. A separator theorem for graphs with an excluded minor and its applications. Proceedings of the 22nd Symposium on Theory of Computing, pages 293-299, 1990.
2. S. N. Bhatt, F. R. K. Chung, J. W. Hong, F. T. Leighton, and A. L. Rosenberg. Optimal simulations by butterfly networks. In Proceedings of the 20th ACM Symposium on Theory of Computing, pages 192-204, 1988.
3. S. Bhatt, F. Chung, T. Leighton, and A. Rosenberg. Optimal simulations of tree machines. In Proceedings of the 27th IEEE Symposium on Foundations of Computer Science, pages 274-282, 1986.
4. S. N. Bhatt and F. T. Leighton. A framework for solving VLSI graph layout problems. Journal of Computer and System Sciences, 28:300-343, 1984.
5. K. Diks, H. N. Djidjev, O. Sykora, and I. Vrto. Edge separators of planar and outerplanar graphs with applications. Journal of Algorithms, 14:258-279, 1993.
6. H. N. Djidjev. A separator theorem. Comptes Rendus de l'Academie Bulgare des Sciences, 34:643-645, 1981.
7. H. N. Djidjev and S. Venkatesan. Reduced constants for simple cycle graph separation. Acta Informatica, 34:231-243, 1997.
8. G. N. Frederickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM Journal on Computing, 16:1004-1022, 1987.
9. H. Gazit and G. L. Miller. Planar separators and the Euclidean norm. In SIGAL 90, Lecture Notes in Computer Science, vol. 450, pages 338-347. Springer-Verlag, Berlin, 1990.
10. J. R. Gilbert, J. P. Hutchinson, and R. E. Tarjan. A separator theorem for graphs of bounded genus. Journal of Algorithms, 5:391-407, 1984.
11. J. R. Gilbert, D. J. Rose, and A. Edenbrandt. A separator theorem for chordal graphs. SIAM Journal on Algebraic and Discrete Methods, 5:306-313, 1984.
12. J. R. Gilbert and R. E. Tarjan. The analysis of a nested dissection algorithm. Numerische Mathematik, 50:377-404, 1987.
13. M. T. Goodrich. Planar separators and parallel polygon triangulation. Proceedings of 24th Symposium on Theory of Computing, pages 507-516, 1992.
14. S. Khuller, B. Raghavachari, and N. Young. Designing multi-commodity flow trees. Information Processing Letters, 50:49-55, 1994.
15. P. Klein, S. Rao, M. Rauch, and S. Subramanian. Faster shortest-path algorithms for planar graphs. In Proceedings of the 26th ACM Symposium on Theory of Computing, pages 27-37, 1994.
16. F. Leighton, F. Makedon, S. Plotkin, S.-Stein, E.Tardos, and S. Tragoudas. Fast approximation algorithms for multicommodity flow problems. Journal of Computer and System Sciences, 50:228-243, 1995.
17. F. T. Leighton and S. Rao. An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, pages 422-431, 1988.
18. C. E. Leiserson. Area Efficient VLSI Computation. MIT Press, Cambridge, MA, 1983.
19. R. J. Lipton, D. J. Rose, and R. E. Tarjan. Generalized nested dissection. SIAM Journal on Numerical Analysis, 16:346-358, 1979.
20. R. J. Lipton and R. E. Tarjan. A separator theorem for planar graphs. SIAM Journal Applied Mathematics, 36:177-189, 1979.
21. R. J. Lipton and R. E. Tarjan. Applications of a planar separator theorem. SIAM Journal on Computing, 9:615-627, 1980.
22. G. L. Miller. Finding small simple cycle separators for 2-connected planar graphs. Journal of Computer and System Sciences, pages 265-279, 1986.
23. G. L. Miller, S.-H. Teng, and S.A. Vavasis. A unified geometric approach to graph separators. Proceedings of the 32nd Symposium on Foundations of Computer Science, pages 538-547, 1991.
24. G. L. Miller and W. Thurston. Separators in two and three dimensions. Proceedings of the 22nd Symposium on Theory of Computing, pages 300-309, 1990.
25. B. Monien and H. Sudborough. Comparing interconnection networks. In Symposium on Mathematical Foundations of Computer Science, volume 320, pages 138-153, 1988.
26. N. Pippenger. Advances in pebbling. In Annual International Colloquium on Automata, Languages and Programming, pages 407-417, 1982.
27. P. D. Seymour and R. Thomas. Call routing and the ratcatcher. Combinatorica, 14:217-241, 1994.
28. S-H. Teng. Points, spheres, and separators: a unified geometric approach to graph partitioning. Ph.D. Thesis CMU-CS-91-184, Carnegie Mellon University, Pittsburgh, PA, 1991.
29. H. Venkateswaran and M. Tompa. A new pebble game that characterizes parallel complexity classes. SIAM Journal on Computing, 18:533-549, 1989.