A Linear-Time Algorithm for Finding a Maximal Planar Subgraph (Q3440266): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| 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/s0895480197328771 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2100261054 / rank | |||
Normal rank | |||
Latest revision as of 11:13, 30 July 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
