A Linear-Time Algorithm for Finding a Maximal Planar Subgraph (Q3440266): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 19:33, 4 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Linear-Time Algorithm for Finding a Maximal Planar Subgraph |
scientific article |
Statements
A Linear-Time Algorithm for Finding a Maximal Planar Subgraph (English)
0 references
22 May 2007
0 references
planar graphs
0 references
planarity testing
0 references
incremental algorithms
0 references
graph planarization
0 references
data structures
0 references
triconnectivity
0 references
