An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:06, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient parallel algorithm for computing a large independent set in a planar graph |
scientific article |
Statements
An efficient parallel algorithm for computing a large independent set in a planar graph (English)
0 references
1991
0 references
planar graphs
0 references
independent set
0 references
