External memory algorithms for outerplanar graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1741, Issue , 1999, Pages 307-316

  Maheshwari, Anil ^a   Zeh, Norbert ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS;

BREADTH-FIRST SEARCH; DEPTH-FIRST-SEARCH (DFS); EXTERNAL MEMORY ALGORITHMS; INTERNAL MEMORY; LINEAR-TIME SOLUTIONS; LOWER BOUNDS; OUTERPLANAR GRAPH; OUTERPLANARITY;

ALGORITHMS;

EID: 84958049684     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46632-0_31     Document Type: Conference Paper

References (12)

1. Y.-J. Chiang, M. T. Goodrich, E. F. Grove, R. Tamassia, D. E. Vengroff, J. S. Vitter. External-memory graph algorithms. Proc. 6th SODA, Jan. 1995.
2. T. H. Cormen, C. E. Leiserson, R. L. Rivest. Introduction to Algorithms. MIT Press, 1990.
3. G. N. Frederickson. Searching among intervals in compact routing tables. Algo-rithmica, 15:448-466, 1996.
4. F. Harary. Graph Theory. Addison-Wesley, 1969.
5. D. Hutchinson, A. Maheshwari, N. Zeh. An external memory data structure for shortest path queries. Proc. COCOON'99, LNCS 1627, pp. 51-50, July 1999.
6. J. van Leeuwen. Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity. MIT Press, 1990.
7. R. J. Lipton, R. E. Tarjan. A separator theorem for planar graphs. SIAM J. on Applied Mathematics, 36(2):177-189, 1979.
8. S. L. Mitchell. Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Inf. Proc. Letters, 9(5):229-232, Dec. 1979.
9. K. Munagala, A. Ranade. I/O-complexity of graph algorithms. Proc. 10th SODA, Jan. 1999.
10. J. S. Vitter. External memory algorithms. Proc. 17th ACM Symp. on Principles of Database Systems, June 1998.
11. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory I: Two-level memories. Algorithmica, 12(2-3):110-147, 1994.
12. N. Zeh. An External-Memory Data Structure for Shortest Path Queries. Diplomarbeit, Fak. f. Math. und Inf. Friedrich-Schiller-Univ. Jena, Nov. 1998.