An algorithm for finding a large independent set in planar graphs (Q4745274): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230130209 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1978360119 / rank | |||
Normal rank | |||
Revision as of 02:30, 20 March 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
