Combinatorics on update digraphs in Boolean networks
From MaRDI portal
Publication:628333
DOI10.1016/j.dam.2010.10.010zbMath1209.05103OpenAlexW2000235460MaRDI 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
Applications of graph theory (05C90) Enumeration in graph theory (05C30) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items (14)
Non-maximal sensitivity to synchronism in elementary cellular automata: exact asymptotic measures ⋮ About non-monotony in Boolean automata networks ⋮ 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 ⋮ Disjunctive networks and update schedules ⋮ Maximum sensitivity to update schedules of elementary cellular automata over infinite configurations ⋮ On the number of update digraphs and its relation with the feedback arc sets and tournaments ⋮ Characterisation of the elementary cellular automata with neighbourhood priority based deterministic updates ⋮ 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
Cites Work
This page was built for publication: Combinatorics on update digraphs in Boolean networks
