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

DOI10.1137/0222068zbMath0799.68151MaRDI QIDQ4277534

Robert Endre Tarjan, Jiazhen Cai, Xiaofeng Han

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

embedding; depth-first search; planarity testing; maximal planar subgraph; selection tree

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

05C10: Planar graphs; geometric and topological aspects of graph theory

94C15: Applications of graph theory to circuits and networks

Related Items

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