Fixed points and maximal independent sets in AND-OR networks

DOI10.1016/S0166-218X(03)00461-XzbMath1076.68047MaRDI QIDQ1827803

Julio Aracena, Eric Goles Chacc, Jacques Demongeot

Publication date: 6 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

graphFixed pointDigraphMaximal independent setBipartiteAND-OR network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Directed graphs (digraphs), tournaments (05C20)

Related Items (23)

Complexity of fixed point counting problems in Boolean networks ⋮ Fixed points in conjunctive networks and maximal independent sets in graph contractions ⋮ Complexity of limit-cycle problems in Boolean networks ⋮ Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory ⋮ Modeling and Analysis of Gene Regulatory Networks ⋮ Liénard systems and potential-Hamiltonian decomposition. II: Algorithm ⋮ Recent techniques and results on the Erdős-Pósa property ⋮ On circuit functionality in Boolean networks ⋮ About non-monotony in Boolean automata networks ⋮ Synchronizing Boolean networks asynchronously ⋮ Boolean analysis of lateral inhibition ⋮ Combinatorics of Boolean automata circuits dynamics ⋮ On the influence of the interaction graph on a finite dynamical system ⋮ Counting periodic points in parallel graph dynamical systems ⋮ Comparison between parallel and serial dynamics of Boolean networks ⋮ Maximum number of fixed points in AND-OR-NOT networks ⋮ Synchrony in reaction–diffusion models of morphogenesis: applications to curvature-dependent proliferation and zero-diffusion front waves ⋮ The dynamics of conjunctive and disjunctive Boolean network models ⋮ An Improved Algorithm for Detecting a Singleton Attractor in a Boolean Network Consisting of AND/OR Nodes ⋮ On the rank and periodic rank of finite dynamical systems ⋮ On the computation of fixed points in Boolean networks ⋮ Algebraic Models and Their Use in Systems Biology ⋮ The number of fixed points of AND-OR networks with chain topology

Cites Work

• The number of fixed points of the majority rule
• Direct calculation of the stable points of a neural network
• Maximal independent sets in bipartite graphs
• Neural networks and physical systems with emergent collective computational abilities.

This page was built for publication: Fixed points and maximal independent sets in AND-OR networks