An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs (Q3954831): 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.1137/0211055 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2042977557 / rank | |||
Normal rank | |||
Latest revision as of 21:45, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs |
scientific article |
Statements
An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs (English)
0 references
1982
0 references
bounded worst case ratio
0 references
time-complexity
0 references
vertex-identification
0 references
