Minimum reload cost graph factors

DOI10.1007/978-3-030-10801-4_7MaRDI QIDQ6830419zbMATH OpenFDO

Authors Julien Baste, Didem Gözüpek, Mordechai Shalom, Dimitrios M. Thilikos

Publication date 22 October 2020

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-10801-4_7

zbMATH Keywords

graph factorsparameterized complexityreload costs

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27) Graph theory (including graph drawing) in computer science (68R10)

This page was built for publication: Minimum reload cost graph factors

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