On structural parameterizations of load coloring

DOI10.1007/978-3-030-67899-9_9MaRDI QIDQ831701zbMATH OpenOpenAlexFDO

Authors I. Vinod Reddy

Publication date 24 March 2022

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

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• scientific article; zbMATH DE number 3641501 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• A more effective linear kernelization for cluster editing
• Algorithmic lower bounds for problems parameterized by clique-width
• Fixed-parameter tractability of graph modification problems for hereditary properties
• On the minimum load coloring problem
• Parameterized algorithms
• Parameterized algorithms for load coloring problem
• Parameterized and approximation algorithms for the load coloring problem
• Threshold graphs and related topics
• Upper bounds to the clique width of graphs

Cited in

(2)

• On structural parameterizations of load coloring
• Parameterized algorithms for load coloring problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831701)