An approximation algorithm for the maximum independent set problem in cubic planar graphs (Q3787812): 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.3230160402 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2158991247 / rank | |||
Normal rank | |||
Revision as of 19:51, 19 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
