Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees (Q5966148): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:21, 30 January 2024
scientific article; zbMATH DE number 985702
| 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 985702 |
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
