Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees

DOI10.1016/0020-0190(95)00069-OzbMath1022.68739WikidataQ127724586 ScholiaQ127724586MaRDI QIDQ5894617

G. Sajith, Sanjeev Saxena

Publication date: 28 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

time parallel algorithm

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Cites Work

• Deterministic parallel list ranking
• Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees

This page was built for publication: Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees