Abstract.
We consider graphs whose vertices may be in one of two different states: either on or off . We wish to maintain dynamically such graphs under an intermixed sequence of updates and queries. An update may reverse the status of a vertex, by switching it either on or off , and may insert a new edge or delete an existing edge. A query tests whether any two given vertices are connected in the subgraph induced by the vertices that are on . We give efficient algorithms that maintain information about connectivity on planar graphs in O( log3 n) amortized time per query, insert, delete, switch-on, and switch-off operation over sequences of at least Ω(n) operations, where n is the number of vertices of the graph.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received September 1997; revised January 1999.
Rights and permissions
About this article
Cite this article
Frigioni, D., Italiano, G. Dynamically Switching Vertices in Planar Graphs . Algorithmica 28, 76–103 (2000). https://doi.org/10.1007/s004530010032
Issue Date:
DOI: https://doi.org/10.1007/s004530010032