Login / Signup

Parameterized algorithms for conflict-free colorings of graphs.

I. Vinod Reddy
Published in: Theor. Comput. Sci. (2018)
Keyphrases
  • conflict free
  • learning algorithm
  • data structure
  • graph theory
  • computational complexity
  • integrity constraints
  • directed graph