An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs (Q3954831): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 00:37, 6 February 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