An approximation algorithm for the maximum independent set problem in cubic planar graphs (Q3787812): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 13:41, 5 March 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
