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

DOI10.1137/16M1107462zbMath1393.68064MaRDI QIDQ5745127

Saket Saurabh, Pradeesha Ashok, Sudeshna Kolay, Aditi Dudeja

Publication date: 5 June 2018

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

conflict-free coloring; FPT algorithms; unique-maximum coloring; maximization algorithms

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W40: Analysis of algorithms

05C65: Hypergraphs

05C15: Coloring of graphs and hypergraphs

05C85: Graph algorithms (graph-theoretic aspects)