Dual parameterization of weighted coloring

DOI10.1007/s00453-020-00686-7zbMath1452.68129arXiv1805.06699MaRDI QIDQ786042

D. Kharzeev

Publication date: 12 August 2020

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1805.06699

zbMATH Keywords

split graphs; interval graphs; parameterized complexity; polynomial kernels; FPT algorithms; dual parameterization; max coloring; weighted coloring

Mathematics Subject Classification ID

68W40: Analysis of algorithms

68R10: Graph theory (including graph drawing) in computer science

05C15: Coloring of graphs and hypergraphs

68Q27: Parameterized complexity, tractability and kernelization