Alpha-algorithms for incremental planarity testing (preliminary version)
From MaRDI portal
Publication:2817665
DOI10.1145/195058.195439zbMath1344.68059OpenAlexW2013148843MaRDI QIDQ2817665
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/195058.195439
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05)
Related Items
A linear algorithm for the maximal planar subgraph problem ⋮ Certificates and fast algorithms for biconnectivity in fully-dynamic graphs ⋮ Planarization of graphs embedded on surfaces ⋮ Dynamic planar embeddings of dynamic graphs ⋮ Small Point-Sets Supporting Graph Stories ⋮ Small point-sets supporting graph stories ⋮ On-line convex planarity testing ⋮ Graph stories in small area ⋮ An analysis of heuristics for graph planarization ⋮ A branch-and-cut approach to the crossing number problem ⋮ Maintenance of triconnected components of graphs ⋮ Incremental convex planarity testing
