An algorithm for finding a large independent set in planar graphs (Q4745274): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/net.3230130209 / rank | |||
| Property / cites work | |||
| Property / cites work: Efficient Planarity Testing / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/NET.3230130209 / rank | |||
Normal rank | |||
Latest revision as of 15:10, 30 December 2024
scientific article; zbMATH DE number 3800941
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for finding a large independent set in planar graphs |
scientific article; zbMATH DE number 3800941 |
Statements
An algorithm for finding a large independent set in planar graphs (English)
0 references
1983
0 references
