Structural parameterizations of budgeted graph coloring

DOI10.1016/j.tcs.2022.11.002OpenAlexW4308580562MaRDI QIDQ5925707

Suman Banerjee, Susobhan Bandopadhyay, Aritra Banik, Venkatesh Raman

Publication date: 20 April 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.11.002

zbMATH Keywords

graph coloringparameterized complexityexact exponential algorithm

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A fast branching algorithm for cluster vertex deletion
• Fundamentals of parameterized complexity
• Parameterized complexity of coloring problems: treewidth versus vertex cover
• Exact exponential algorithms.
• On the complexity of some colorful problems parameterized by treewidth
• Equitable coloring of trees
• Mutual exclusion scheduling
• Structural parameterizations for equitable coloring
• Kernelization
• Linear Time Algorithms for Knapsack Problems with Bounded Weights
• Kernelization Lower Bounds by Cross-Composition
• Parameterized Algorithms
• Parameterized Pre-Coloring Extension and List Coloring Problems
• Structural parameterizations of budgeted graph coloring

This page was built for publication: Structural parameterizations of budgeted graph coloring