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

DOI10.1007/978-3-319-91938-6_9zbMATH Open1392.93005OpenAlexW2803246866MaRDI QIDQ1660123FDOQ1660123

Eugen Czeizler, Victor Popescu, Alexandru Popa

Publication date: 15 August 2018

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

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

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)

Cited In (1)

• An overview of structural systems theory

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)