Maximum number of fixed points in AND-OR-NOT networks

DOI10.1016/j.jcss.2014.04.025zbMath1311.68100OpenAlexW2157825915MaRDI QIDQ2453540

Julio Aracena, Lilian Salinas, Adrien Richard

Publication date: 10 June 2014

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2014.04.025

zbMATH Keywords

fixed pointmaximal independent setBoolean networkAND-OR-NOT network

Mathematics Subject Classification ID

Related Items (13)

Complexity of fixed point counting problems in Boolean networks ⋮ Fixed points in conjunctive networks and maximal independent sets in graph contractions ⋮ Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory ⋮ Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions ⋮ Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks ⋮ Boolean analysis of lateral inhibition ⋮ On the influence of the interaction graph on a finite dynamical system ⋮ Maximum number of periodic orbits in parallel dynamical systems ⋮ Counting periodic points in parallel graph dynamical systems ⋮ Positive and negative cycles in Boolean networks ⋮ On the flora of asynchronous locally non-monotonic Boolean automata networks ⋮ Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs ⋮ On periods and equilibria of computational sequential systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal problems for independent set enumeration
• Two problems on independent sets in graphs
• Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time
• Maximum number of fixed points in regulatory Boolean networks
• Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
• A sharp upper bound for the number of stable sets in graphs with given number of cut edges
• The number of maximal independent sets in a connected graph
• Fixed points and maximal independent sets in AND-OR networks
• On the computation of fixed points in Boolean networks
• An Entropy Approach to the Hard-Core Model on Bipartite Graphs
• Maximal independent sets in bipartite graphs
• The Number of Independent Sets in a Regular Graph
• The number of maximal independent sets in connected graphs
• On maximal independent sets of nodes in trees
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• On cliques in graphs

This page was built for publication: Maximum number of fixed points in AND-OR-NOT networks