Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees (Q5966148): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(95)00061-g / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W205688220 / rank | |||
Normal rank | |||
Latest revision as of 10:58, 30 July 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
