An algorithm for finding a large independent set in planar graphs (Q4745274)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for finding a large independent set in planar graphs |
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
