Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees (Q5894617)
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 985327
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees |
scientific article; zbMATH DE number 985327 |
Statements
Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees (English)
0 references
28 February 1997
0 references
time parallel algorithm
0 references
