Skip to main content
SpringerLink
Log in
SpringerLink
Log in

External Memory Algorithms for Outerplanar Graphs

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1741))

Included in the following conference series:

Abstract

We present external memory algorithms for outerplanarity testing, embedding outerplanar graphs, breadth-first search (BFS) and depth-first search (DFS) in outerplanar graphs, and finding a \( \frac{2} {3} \) -separator of size 2 for a given outerplanar graph. Our algorithms take O(sort(N)) I/Os and can easily be improved to take O(perm(N)) I/Os, as all these problems have linear time solutions in internal memory. For BFS, DFS, and outerplanar embedding we show matching lower bounds.

Research supported by NSERC and NCE GEOIDE.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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.

    Google Scholar 

  2. T. H. Cormen, C. E. Leiserson, R. L. Rivest. Introduction to Algorithms. MIT Press, 1990.

    Google Scholar 

  3. G. N. Frederickson. Searching among intervals in compact routing tables. Algorithmica, 15:448–466, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  4. F. Harary. Graph Theory. Addison-Wesley, 1969.

    Google Scholar 

  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.

    Google Scholar 

  6. J. van Leeuwen. Handbook of Theoretical Computer Science, Vol. A: Algorithms and Complexity. MIT Press, 1990.

    Google Scholar 

  7. R. J. Lipton, R. E. Tarjan. A separator theorem for planar graphs. SIAM J. on Applied Mathematics, 36(2):177–189, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  8. S. L. Mitchell. Linear algorithms to recognize outerplanar and maximal outerplanar graphs. Inf. Proc. Letters, 9(5):229–232, Dec. 1979.

    Article  MATH  Google Scholar 

  9. K. Munagala, A. Ranade. I/O-complexity of graph algorithms. Proc. 10th SODA, Jan. 1999.

    Google Scholar 

  10. J. S. Vitter. External memory algorithms. Proc. 17th ACM Symp. on Principles of Database Systems, June 1998.

    Google Scholar 

  11. J. S. Vitter and E. A. M. Shriver. Algorithms for parallel memory I: Two-level memories. Algorithmica, 12(2-3):110–147, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  12. N. Zeh. An External-Memory Data Structure for Shortest Path Queries. Diplomarbeit, Fak. f. Math. und Inf. Friedrich-Schiller-Univ. Jena, Nov. 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carleton University, Ottawa, Canada

    Anil Maheshwari & Norbert Zeh

Authors
  1. Anil Maheshwari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Norbert Zeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Maheshwari, A., Zeh, N. (1999). External Memory Algorithms for Outerplanar Graphs. In: Algorithms and Computation. ISAAC 1999. Lecture Notes in Computer Science, vol 1741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46632-0_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-46632-0_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66916-6

  • Online ISBN: 978-3-540-46632-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation