On the number of update digraphs and its relation with the feedback arc sets and tournaments
Authors:
- J. AracenaJAJ. Aracena
- J. DemongeotJDJ. Demongeot
- E. FanchonEFE. Fanchon
- M. MontalvaMMM. Montalva
- 1 July 2013
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 161 (10-11) , 1345-1355
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- Combinatorics on update digraphs in Boolean networksDiscrete Applied Mathematics, 2011
- On the robustness of update schedules in Boolean networksBioSystems, 2009
- Robustness in Regulatory Networks: A Multi-Disciplinary ApproachActa Biotheoretica, 2008
- The role of certain Post classes in Boolean network models of genetic networksProceedings of the National Academy of Sciences, 2003
- Boolean formalization of genetic control circuitsJournal of Theoretical Biology, 1973
- Metabolic stability and epigenesis in randomly constructed genetic netsJournal of Theoretical Biology, 1969
- Minimum Feedback Arc Sets for a Directed GraphIEEE Transactions on Circuit Theory, 1963