6 citations · 8 across the 6 of their papers we have counts for
1 paper · 2 filters
Akanksha Agrawal, Pradeesha Ashok, Meghana M Reddy +2
We present fixed parameter tractable algorithms for the conflict-free coloring problem on graphs. Given a graph G=(V,E), \emph{conflict-free coloring} of G refers to coloring a…