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

DOI10.1016/J.JCSS.2014.04.025MaRDI QIDQ2453540zbMATH OpenOpenAlexFDO

Authors Julio Aracena, Adrien Richard, Lilian Salinas

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 pointBoolean networkmaximal independent setAND-OR-NOT network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Fixed points and maximal independent sets in AND-OR networks
• The number of fixed points of AND-OR networks with chain topology
• Complexity of maximum fixed point problem in Boolean networks
• Maximum number of fixed points in regulatory Boolean networks
• Number of fixed points and disjoint cycles in monotone Boolean networks
• On the computation of fixed points in Boolean networks
• Fixed points in conjunctive networks and maximal independent sets in graph contractions
• Complexity of fixed point counting problems in Boolean networks
• Fixed points of Boolean networks with small number of elementary circuits
• Fixed points of Boolean networks, guessing graphs, and coding theory

Cites work

• scientific article; zbMATH DE number 4042465 (Why is no real title available?)
• scientific article; zbMATH DE number 3745213 (Why is no real title available?)
• scientific article; zbMATH DE number 42045 (Why is no real title available?)
• scientific article; zbMATH DE number 50840 (Why is no real title available?)
• A sharp upper bound for the number of stable sets in graphs with given number of cut edges
• An entropy approach to the hard-core model on bipartite graphs
• Determining a singleton attractor of an AND/OR Boolean network in \(O(n^{1.587})\) time
• Extremal problems for independent set enumeration
• Fixed points and maximal independent sets in AND-OR networks
• Graphic requirements for multistability and attractive cycles in a Boolean dynamical framework
• Maximal independent sets in bipartite graphs
• Maximum number of fixed points in regulatory Boolean networks
• On cliques in graphs
• On maximal independent sets of nodes in trees
• On the computation of fixed points in Boolean networks
• The Number of Maximal Independent Sets in Triangle-Free Graphs
• The number of independent sets in a regular graph
• The number of maximal independent sets in a connected graph
• The number of maximal independent sets in connected graphs
• Two problems on independent sets in graphs

Cited in

(20)

• The number of fixed points of AND-OR networks with chain topology
• Counting periodic points in parallel graph dynamical systems
• Fixed points and maximal independent sets in AND-OR networks
• Fixed points in conjunctive networks and maximal independent sets in graph contractions
• Generalising the maximum independent set algorithm via Boolean networks
• Study of Boolean networks via matrices of support
• Fixed points in generalized parallel and sequential dynamical systems induced by a minterm or maxterm Boolean functions
• Computation of fixed points in MAX and MIN multi-state networks
• Maximum number of periodic orbits in parallel dynamical systems
• Number of fixed points and disjoint cycles in monotone Boolean networks
• Existence, coexistence and uniqueness of fixed points in parallel and sequential dynamical systems over directed graphs
• Complexity of fixed point counting problems in Boolean networks
• Boolean analysis of lateral inhibition
• On the flora of asynchronous locally non-monotonic Boolean automata networks
• Fixed points of Boolean networks, guessing graphs, and coding theory
• Positive and negative cycles in Boolean networks
• On the computation of fixed points in Boolean networks
• On periods and equilibria of computational sequential systems
• On the influence of the interaction graph on a finite dynamical system
• Counting fixed points and pure 2-cycles of tree cellular automata

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2453540)