Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs

DOI10.1007/978-3-662-48971-0_24zbMath1391.68087OpenAlexW2296531960MaRDI QIDQ3459868

Aditi Dudeja, Pradeesha Ashok, Sudeshna Kolay

Publication date: 11 January 2016

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-48971-0_24

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Conflict-Free Coloring of Graphs ⋮ Conflict-Free Coloring of Intersection Graphs ⋮ Parameterized algorithms for conflict-free colorings of graphs

This page was built for publication: Exact and FPT Algorithms for Max-Conflict Free Coloring in Hypergraphs