An efficient parallel algorithm for computing a large independent set in a planar graph (Q808288): Difference between revisions
From MaRDI portal
Removed claims |
Changed an Item |
||
| Property / author | |||
| Property / author: Marek Chrobak / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Joseph (Seffi) Naor / rank | |||
Normal rank | |||
Revision as of 11:09, 12 February 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
