Fixed parameter algorithms and hardness of approximation results for the structural target controllability problem

DOI10.1007/978-3-319-91938-6_9MaRDI QIDQ1660123zbMATH OpenOpenAlexFDO

Authors Eugen Czeizler, Alexandru Popa, Victor Popescu

Publication date 15 August 2018

Full work available at URL https://doi.org/10.1007/978-3-319-91938-6_9

zbMATH Keywords

approximation algorithmssystems biologyfixed parameter algorithmsprotein interaction networksstructural network control

Mathematics Subject Classification ID

Systems biology, networks (92C42) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Controllability (93B05)

Recommendations

• Constrained target controllability of complex networks
• Controllability and algorithms of complex networks
• Target control and expandable target control of complex networks
• Control of Boolean networks: hardness results and algorithms for tree structured networks
• Optimizing the controllability of arbitrary networks with genetic algorithm

Cited in

(3)

• Fixed parameter algorithms and hardness of approximation results for the structural target controllability problem
• An overview of structural systems theory
• Fixed node determination and analysis in directed acyclic graphs of structured networks

This page was built for publication: Fixed parameter algorithms and hardness of approximation results for the structural target controllability problem

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