An approximation algorithm for the maximum independent set problem in cubic planar graphs (Q3787812): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:28, 5 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approximation algorithm for the maximum independent set problem in cubic planar graphs |
scientific article |
Statements
An approximation algorithm for the maximum independent set problem in cubic planar graphs (English)
0 references
1986
0 references
polynomial time approximation algorithm
0 references
maximal independent set
0 references
cubic planar graphs
0 references
