Login / Signup

Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs.

Pradeesha AshokAditi DudejaSudeshna KolaySaket Saurabh
Published in: SIAM J. Discret. Math. (2018)
Keyphrases
  • conflict free
  • graph theory
  • artificial intelligence
  • query processing
  • np hard
  • computational problems
  • fixed parameter tractable