Fixed points in conjunctive networks and maximal independent sets in graph contractions
From MaRDI portal
Publication:2361351
DOI10.1016/j.jcss.2017.03.016zbMath1371.68204arXiv1507.06141OpenAlexW2964198721MaRDI QIDQ2361351
Lilian Salinas, Julio Aracena, Adrien Richard
Publication date: 30 June 2017
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.06141
Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (8)
Synchronizing Boolean networks asynchronously ⋮ Boolean analysis of lateral inhibition ⋮ Attractor separation and signed cycles in asynchronous Boolean networks ⋮ Counting periodic points in parallel graph dynamical systems ⋮ Positive and negative cycles in Boolean networks ⋮ On the effects of firing memory in the dynamics of conjunctive networks ⋮ On the effects of firing memory in the dynamics of conjunctive networks ⋮ Sequentialization and procedural complexity in automata networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The dynamics of conjunctive and disjunctive Boolean network models
- Maximum number of fixed points in regulatory Boolean networks
- Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
- Iterative behaviour of generalized majority functions
- Dynamics of positive automata networks
- On generating all maximal independent sets
- Packing directed circuits
- Fixed points and maximal independent sets in AND-OR networks
- From kernels in directed graphs to fixed points and negative cycles in Boolean networks
- On periodical behaviour in societies with symmetric influences
- Information flows, graphs and their guessing numbers
- Maximum number of fixed points in AND-OR-NOT networks
- On the computation of fixed points in Boolean networks
- Multistationarity, the basis of cell differentiation and memory. II. Logical analysis of regulatory networks in terms of feedback circuits
- On the Convergence of Boolean Automata Networks without Negative Cycles
- Reduction and Fixed Points of Boolean Networks and Linear Network Coding Solvability
- A Biological Solution to a Fundamental Distributed Computing Problem
- Fixed Points of Boolean Networks, Guessing Graphs, and Coding Theory
- Graph-Theoretical Constructions for Graph Entropy and Network Coding Based Communications
- Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks
- Neural networks and physical systems with emergent collective computational abilities.
- A logical calculus of the ideas immanent in nervous activity
This page was built for publication: Fixed points in conjunctive networks and maximal independent sets in graph contractions