I/O-optimal algorithms for planar graphs using separators

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 372-381

  Maheshwari, Anil ^a   Zeh, Norbert ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; GRAPHIC METHODS; SEPARATORS; TREES (MATHEMATICS);

BREADTH-FIRST SEARCH; BREADTH-FIRST-SEARCH TREES; DEPTH FIRST SEARCH; EXTERNAL MEMORY ALGORITHMS; PLANAR EMBEDDING; PLANAR GRAPH; SINGLE SOURCE SHORTEST PATHS; VERTEX SEPARATORS;

ALGORITHMS;

EID: 84968761436     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. J. Abello, A. L. Buchsbaum, J. Westbrook. A functional approach to external graph algorithms. Proc. BSA, pp. 332-343, 1998.
2. P. K. Agarwal, L. Arge, T. M. Murali, K. R. Varadara-jan, J. S. Vitter. I/O-efficient algorithms for contour-line extraction and planar graph blocking. Proc. SODA, pp. 117-126, 1998.
3. L. Aleksandrov, H. Djidjev. Linear algorithms for partitioning embedded graphs of bounded genus. SIAM J. Disc. Math., 9:129-150, 1996.
4. L. Arge. The buffer tree: A new technique for optimal I/O-algorithms. Proc. WADS, pp. 334-345, 1995.
5. L. Arge, G. S. Brodal, L. Toma. On external memory MST, SSSP, and multi-way planar separators. Proc. SWAT, pp. 433-447, 2000.
6. L. Arge, U. Meyer, L. Toma, N. Zeh. On external-memory planar depth first search. Proc. WADS, pp. 471-482, 2001.
7. J. Boyer, W. Myrvold. Stop minding your P's and Q's: A simplified O(n) planar embedding algorithm. Proc. SODA, pp. 140-146, 1999.
8. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, J. S. Vitter. External-memory graph algorithms. Proc. SODA, pp. 139-149, 1995.
9. G. N. Frederickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comp., 16:1004-1022, 1987.
10. J. Hopcroft, R. E. Tarjan. Dividing a graph into triconnected components. SIAM J. Comp., 2:135-158, 1973.
11. J. Hopcroft, R. E. Tarjan. Efficient planarity testing. J. ACM, 21:549-568, 1974.
12. D. Hutchinson, A. Maheshwari, N. Zeh. An external memory data structure for shortest path queries. Proc. COCOON, pp. 51-60, 1999. To appear in Disc. Appl. Math.
13. P. Klein, S. Rao, M. Rauch, and S. Subramanian. Faster shortest path algorithms for planar graphs. J. Comp. Sys. Sci., 55:3-23, 1997.
14. V. Kumar, E. J. Schwabe. Improved algorithms and data structures for solving graph problems in external memory. Proc. SPDP, pp. 169-176, 1996.
15. R. J. Lipton, R. E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math., 36:177-189, 1979.
16. A. Maheshwari, N. Zeh. External memory algorithms for outerplanar graphs. Proc. ISAAC, pp. 307-316, 1999.
17. A. Maheshwari, N. Zeh. I/O-efficient algorithms for graphs of bounded treewidth. Proc. SODA, pp. 89-90, 2001.
18. U. Meyer. External memory BFS on undirected graphs with bounded degree. Proc. SODA, pp. 87-88, 2001.
19. K. Munagala, A. Raiiade. I/O-complexity of graph algorithms. Proc. SODA, pp. 687-694, 1999.
20. J. S. Vitter. External memory algorithms and data structures. In J. Abello and J. S. Vitter, eds., External Memory Algorithms and Visualization. AMS, 1999.
21. J. S. Vitter, E. A. M. Shriver. Algorithms for parallel memory I: Two-level memories. Algorithmica, 12:110-147, 1994.
22. H. Whitney. Congruent graphs and the connectivity of graphs. Amer. J. Math., 54:150-168, 1932.
23. N. Zeh. I/O-efficient planar embedding using graph separators. TR-01-07, School of Comp. Sci., Carleton University, 2001.
24. N. Zeh. I/O-efficient planar separators and applications. TR-01-02, School of Comp. Sci., Carleton University, 2001.