Years and Authors of Summarized Original Work
1999; Galil, Italiano, Sarnak
Problem Definition
In this entry, the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding is considered. Before formally defining the problem, few preliminary definitions follow.
A graph is planar if it can be embedded in the plane so that no two edges intersect. In a dynamic framework, a planar graph that is committed to an embedding is called plane, and the general term planar is used only when changes in the embedding are allowed. An edge insertion that preserves the embedding is called embedding‐preserving, whereas it is called planarity‐preserving if it keeps the graph planar, even though its embedding can change; finally, an edge insertion is called arbitraryif it is not known to preserve planarity. Extensive work on dynamic graph algorithms has used ad hoc techniques to solve a number of problems such as...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Cimikowski R (1994) Branch-and-bound techniques for the maximum planar subgraph problem. Int J Comput Math 53:135–147
Eppstein D, Galil Z, Italiano GF, Nissenzweig A (1997) Sparsification – a technique for speeding up dynamic graph algorithms. J Assoc Comput Mach 44(5):669–696
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
Eppstein D, Galil Z, Italiano GF, Spencer TH (1999) Separator based sparsification II: edge and vertex connectivity. SIAM J Comput 28:341–381
Eppstein D, Italiano GF, Tamassia R, Tarjan RE, Westbrook J, Yung M (1992) Maintenance of a minimum spanning forest in a dynamic plane graph. J Algorithms 13:33–54
Frederickson GN (1985) Data structures for on-line updating of minimum spanning trees, with applications. SIAM J Comput 14:781–798
Frederickson GN (1997) Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees. SIAM J Comput 26(2):484–538
Galil Z, Italiano GF, Sarnak N (1999) Fully dynamic planarity testing with applications. J ACM 48:28–91
Giammarresi D, Italiano GF (1996) Decremental 2- and 3-connectivity on planar graphs. Algorithmica 16(3):263–287
Hershberger J, Suri MR, Suri S (1994) Data structures for two-edge connectivity in planar graphs. Theor Comput Sci 130(1):139–161
Italiano GF, La Poutré JA, Rauch M (1993) Fully dynamic planarity testing in planar embedded graphs. In: 1st annual European symposium on algorithms, Bad Honnef, 30 Sept–2 Oct
Tamassia R (1988) A dynamic data structure for planar graph embedding. In: 15th international colloquium automata, languages, and programming. LNCS, vol 317. Springer, Berlin, pp 576–590
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Italiano, G.F. (2016). Fully Dynamic Planarity Testing. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_157
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_157
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering