An O(m\log n)-Time Algorithm for the Maximal Planar Subgraph Problem
From MaRDI portal
An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem
Cited in
(20)- 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
- Maximum-weight planar boxes in \(O(n^2)\) time (and better)
- A simulated annealing algorithm for determining the thickness of a graph
- A subset spanner for Planar graphs, with application to subset TSP
- Finding triangles for maximum planar subgraphs
- scientific article; zbMATH DE number 562727 (Why is no real title available?)
- An analysis of heuristics for graph planarization
- Branch-and-bound techniques for the maximum planar subgraph problem∗
- A linear algorithm for the maximal planar subgraph problem
- Planarization of graphs embedded on surfaces
- A linear time algorithm for finding maximal planar subgraphs
- Spanning cactus and spanning cactus extension of outerplanar graphs
- Local optimization algorithms for maximum planar subgraph
- A branch-and-cut approach to the crossing number problem
- A self-stabilizing algorithm for the maximum planarization problem in complete bipartite networks
This page was built for publication: An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4277534)
