An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem

DOI10.1137/0222068zbMath0799.68151OpenAlexW2035471954MaRDI QIDQ4277534

Jiazhen Cai, Xiaofeng Han, Robert Endre Tarjan

Publication date: 7 February 1994

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0222068

zbMATH Keywords

embeddingdepth-first searchplanarity testingmaximal planar subgraphselection tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Applications of graph theory to circuits and networks (94C15)

Related Items

A linear algorithm for the maximal planar subgraph problem ⋮ Maximum planar subgraphs and nice embeddings: Practical layout tools ⋮ Gap strings and spanning forests for bridge graphs of biconnected graphs ⋮ Branch-and-bound techniques for the maximum planar subgraph problem^∗ ⋮ Planarization of graphs embedded on surfaces ⋮ Finding Triangles for Maximum Planar Subgraphs ⋮ A new planarity test ⋮ An analysis of heuristics for graph planarization ⋮ A branch-and-cut approach to the crossing number problem ⋮ A new neural network algorithm for planarization problems ⋮ A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks ⋮ Non-planar core reduction of graphs ⋮ A simulated annealing algorithm for determining the thickness of a graph ⋮ A genetic algorithm for determining the thickness of a graph