Combinatorics on update digraphs in Boolean networks
From MaRDI portal
Publication:628333
DOI10.1016/j.dam.2010.10.010zbMath1209.05103MaRDI QIDQ628333
E. Fanchon, Julio Aracena, Marco Montalva, Mathilde Noual
Publication date: 10 March 2011
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.10.010
05C90: Applications of graph theory
05C30: Enumeration in graph theory
05C20: Directed graphs (digraphs), tournaments
05C40: Connectivity
Related Items
About block-parallel Boolean networks: a position paper, Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations, Attractor landscapes in Boolean networks with firing memory: a theoretical study applied to genetic networks, About non-monotony in Boolean automata networks, Disjunctive networks and update schedules, Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updates, Sequentialization and procedural complexity in automata networks, From multiple to single updates per cell in elementary cellular automata with neighbourhood based priority, A spectral outlook on the elementary cellular automata with cyclic configurations and block-sequential asynchronous updates, \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method, Non-maximal sensitivity to synchronism in elementary cellular automata: exact asymptotic measures, Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations, Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates, On the number of update digraphs and its relation with the feedback arc sets and tournaments
Cites Work
