Login / Signup

Corrigendum: Optimal Parallel Algorithms for Coloring Bounded Degree Graphs and Finding Maximal Independent Sets in Rooted Trees.

G. SajithSanjeev Saxena
Published in: Inf. Process. Lett. (1995)
Keyphrases
  • parallel algorithm
  • bounded degree
  • rooted trees
  • graph theoretic
  • optimal solution
  • bounded treewidth
  • dynamic programming
  • subgraph isomorphism
  • social networks
  • database systems
  • relational databases
  • graph mining