Abstract
We present the first data structure to maintain an embedded planar graph under arbitrary edge insertions, arbitrary edge deletions and queries that test whether the insertion of a new edge would violate the planarity of the embedding. Our data structure supports online updates and queries on an n-vertex embedded planar graph in O(log2 n) worst-case time, it can be built in linear time and requires linear storage.
Cite
CITATION STYLE
Italiano, G. F., La Poutré, J. A., & Rauch, M. H. (1993). Fully dynamic planarity testing in planar embedded graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 726 LNCS, pp. 212–223). Springer Verlag. https://doi.org/10.1007/3-540-57273-2_57
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
