An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs (Q3954831): 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 14:39, 5 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
