On structural parameterizations of load coloring

DOI10.1016/j.dam.2023.09.001OpenAlexW3092295815MaRDI QIDQ6184323

I. Vinod Reddy

Publication date: 24 January 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.09.001

zbMATH Keywords

NP-completenessparameterized complexityload coloring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item
• Unnamed Item
• On structural parameterizations of load coloring
• A more effective linear kernelization for cluster editing
• Fixed-parameter tractability of graph modification problems for hereditary properties
• Threshold graphs and related topics
• Upper bounds to the clique width of graphs
• Parameterized and approximation algorithms for the load coloring problem
• Parameterized algorithms for load coloring problem
• On the minimum load coloring problem
• Approximating clique-width and branch-width
• Parameterized Algorithms

This page was built for publication: On structural parameterizations of load coloring