On the parameterized complexity of dynamic problems with connectivity constraints

DOI10.1007/978-3-319-12691-3_47MaRDI QIDQ2942438zbMATH OpenOpenAlexFDO

Authors

Publication date 11 September 2015

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-12691-3_47

zbMATH Keywords

dynamic connected dominating setdynamic problemsparameterized complexityre-optimization

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

Recommendations

• On the parameterized complexity of dynamic problems
• Dynamic Parameterized Problems
• Dynamic parameterized problems
• Parameterized dynamic variants of red-blue dominating set
• On the parameterized complexity of reconfiguration of connected dominating sets

Cited in

(6)

• Inferring local transition functions of discrete dynamical systems from observations of system behavior
• Parameterized dynamic variants of red-blue dominating set
• Dynamic dominating set and turbo-charging greedy heuristics
• An s-t connection problem with adaptability
• Dynamic parameterized problems
• On the parameterized complexity of dynamic problems

This page was built for publication: On the parameterized complexity of dynamic problems with connectivity constraints

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