Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees
From MaRDI portal
Publication:5894617
DOI10.1016/0020-0190(95)00069-OzbMath1022.68739WikidataQ127724586 ScholiaQ127724586MaRDI QIDQ5894617
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cites Work
This page was built for publication: Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees