Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees (Q5906512)
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: Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees |
scientific article; zbMATH DE number 561601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees |
scientific article; zbMATH DE number 561601 |
Statements
Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees (English)
0 references
3 May 1994
0 references
parallel algorithms
0 references
graph coloring
0 references
optimal algorithm
0 references
maximal independent set
0 references
EREW PRAM
0 references
CREW PRAM
0 references
rooted tree
0 references
0.9991658329963684
0 references
0.9078981876373292
0 references
