Skip to main content
SpringerLink
Log in

Fully Dynamic Higher Connectivity for Planar Graphs

  • Reference work entry
  • First Online:
Encyclopedia of Algorithms

  • 117 Accesses

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 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover 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

Recommended Reading

  1. Galil Z, Italiano GF, Sarnak N (1999) Fully dynamic planarity testing with applications. J ACM 48:28–91

    Article  MathSciNet  MATH  Google Scholar 

  2. Eppstein D, Galil Z, Italiano GF, Spencer TH (1996) Separator based sparsification I: planarity testing and minimum spanning trees. J Comput Syst Sci Spec Issue STOC 93 52(1):3–27

    Article  MathSciNet  MATH  Google Scholar 

  3. Eppstein D, Galil Z, Italiano GF, Spencer TH (1999) Separator based sparsification II: edge and vertex connectivity. SIAM J Comput 28:341–381

    Article  MathSciNet  MATH  Google Scholar 

  4. Giammarresi D, Italiano GF (1996) Decremental 2- and 3-connectivity on planar graphs. Algorithmica 16(3):263–287

    Article  MathSciNet  MATH  Google Scholar 

  5. Hershberger J, Rauch M, Suri S (1994) Data structures for two-edge connectivity in planar graphs. Theor Comput Sci 130(1):139–161

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Systems Science, University of Rome, Rome, Italy

    Giuseppe F. Italiano

  2. Department of Information and Computer Systems, University of Rome, Rome, Italy

    Giuseppe F. Italiano

Authors
  1. Giuseppe F. Italiano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Italiano, G.F. (2016). Fully Dynamic Higher Connectivity for Planar Graphs. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_155

Download citation

Publish with us

Policies and ethics

Search

Navigation