Maintaining Center and Median in Dynamic Trees
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
A Linear Time Implementation of SPQR-Trees
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
Quantitative information flow as network flow capacity
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Layered upward embedding of acyclic digraphs
MATH'08 Proceedings of the 13th WSEAS international conference on Applied mathematics
The Triconnected Abstraction of Process Models
BPM '09 Proceedings of the 7th International Conference on Business Process Management
Unveiling Hidden Unstructured Regions in Process Models
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
The SPQR-tree data structure in graph drawing
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Determining the smallest k such that G is k-outerplanar
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Steinitz theorems for orthogonal polyhedra
Proceedings of the twenty-sixth annual symposium on Computational geometry
GD'04 Proceedings of the 12th international conference on Graph Drawing
An effective ant colony algorithm for graph planarization problem
ICIC'11 Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applications
Brief announcement: speedups for parallel graph triconnectivity
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
The vulcan game of kal-toh: finding or making triconnected planar subgraphs
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Planar lombardi drawings for subcubic graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
The incremental planarity testing problem consists of performing the following operations on a planar graph G with n vertices: (1) testing whether a new edge can be added to G so that the resulting graph is itself planar; (2) adding vertices and edges such that planarity is preserved. An efficient technique for incremental planarity testing that uses O(n) space and supports tests and insertion of vertices and edges in O(log n) time is presented. The bounds for queries and vertex insertions are worst case, and the bound for edge insertions is amortized.