An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem (Q4277534)
From MaRDI portal
scientific article; zbMATH DE number 495785
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem |
scientific article; zbMATH DE number 495785 |
Statements
An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem (English)
0 references
7 February 1994
0 references
depth-first search
0 references
embedding
0 references
selection tree
0 references
planarity testing
0 references
maximal planar subgraph
0 references
