Fully dynamic planarity testing with applications
From MaRDI portal
Publication:3158532
DOI10.1145/300515.300517zbMath1064.05502OpenAlexW2075541196MaRDI QIDQ3158532
Neil Sarnak, Giuseppe F. Italiano, Zvi Galil
Publication date: 25 January 2005
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/300515.300517
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (8)
A simulated annealing algorithm for the maximum planar subgraph problem ⋮ Dynamic planar embeddings of dynamic graphs ⋮ Fully dynamic maintenance of vertex cover ⋮ Dynamic and static algorithms for optimal placement of resources in a tree ⋮ Stochastic graphs have short memory: Fully dynamic connectivity in poly-log expected time ⋮ Faster shortest-path algorithms for planar graphs ⋮ Unnamed Item ⋮ Heuristics for the maximum outerplanar subgraph problem
This page was built for publication: Fully dynamic planarity testing with applications
