An $O(m\log n)$-Time Algorithm for the Maximal Planar Subgraph Problem (Q4277534): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Robert Endre Tarjan / rank | |||
| Property / author | |||
| Property / author: Robert Endre Tarjan / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0222068 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035471954 / rank | |||
Normal rank | |||
Latest revision as of 21:53, 19 March 2024
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
