Minimum conflict free colouring parameterized by treewidth
DOI10.1007/978-3-030-39219-2_35zbMath1453.68094OpenAlexW3002321458MaRDI QIDQ779250
Pradeesha Ashok, Naman Gupta, Dolly Yadav, Mohammad Khalid, Rathin Bhargava
Publication date: 21 July 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-39219-2_35
treewidthparameterized complexityexponential time hypothesisFPT algorithmsconflict-free colouring of graphsstrong exponential time hypothesis
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Parameterized complexity, tractability and kernelization (68Q27)
This page was built for publication: Minimum conflict free colouring parameterized by treewidth
