Optimal parallel 3-coloring algorithm for rooted trees and its applications
From MaRDI portal
Publication:1186596
DOI10.1016/0020-0190(92)90045-WzbMath0742.68028MaRDI QIDQ1186596
Publication date: 28 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items
Optimal parallel algorithms for coloring bounded degree graphs and finding maximal independent sets in rooted trees, Selection of programme slots of television channels for giving advertisement: a graph theoretic approach
Cites Work