An algorithm for finding a large independent set in planar graphs (Q4745274): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Efficient Planarity Testing / rank | |||
Normal rank | |||
Revision as of 17:22, 13 June 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
