An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient parallel algorithm for computing a large independent set in a planar graph |
scientific article; zbMATH DE number 4209633
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient parallel algorithm for computing a large independent set in a planar graph |
scientific article; zbMATH DE number 4209633 |
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
0.8982933759689331
0 references
0.8870023488998413
0 references
0.8499537110328674
0 references
0.848336398601532
0 references
0.8324517011642456
0 references
