Login / Signup
Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees.
G. Sajith
Sanjeev Saxena
Published in:
Inf. Process. Lett. (1994)
Keyphrases
</>
parallel algorithm
bounded degree
rooted trees
graph theoretic
database
databases
database systems
dynamic programming