✦ LIBER ✦
Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
✍ Scribed by G. Sajith; Sanjeev Saxena
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 474 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0020-0190
No coin nor oath required. For personal study only.