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

DOI10.1016/0020-0190(95)00061-GzbMath1004.68601OpenAlexW205688220MaRDI QIDQ5966148

G. Sajith, Sanjeev Saxena

Publication date: 28 February 1997

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

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00061-g

Mathematics Subject Classification ID

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

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