On structural parameterizations of load coloring
From MaRDI portal
Publication:831701
DOI10.1007/978-3-030-67899-9_9OpenAlexW3126524284MaRDI QIDQ831701FDOQ831701
Publication date: 24 March 2022
Full work available at URL: https://arxiv.org/abs/2010.05186
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fixed-parameter tractability of graph modification problems for hereditary properties
- Threshold graphs and related topics
- Upper bounds to the clique width of graphs
- Parameterized Algorithms
- A more effective linear kernelization for cluster editing
- Parameterized and approximation algorithms for the load coloring problem
- Parameterized algorithms for load coloring problem
- On the minimum load coloring problem
Cited In (2)
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)
