Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees: Information Processing Letters 49 (6) (22 March 1994) 303–308

✍ Scribed by G. Sajith; Sanjeev Saxena

• Book ID: 107766254
• Publisher: Elsevier Science
• Year: 1995
• Tongue: English
• Weight: 61 KB
• Volume: 54
• Category: Article
• ISSN: 0020-0190
• DOI: 10.1016/0020-0190(95)00069-o