Maximum number of fixed points in AND–OR–NOT networks
Authors:
- J. AracenaJAJ. Aracena
- A. RichardARA. Richard
- L. SalinasLSL. Salinas
- 1 November 2014
- journal article
- research article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 80 (7) , 1175-1190
Abstract
No abstract availableKeywords
Funding Information
- FONDECYT (1131013)
- Anillo (ACT-87)
- Universidad de Chile
- Centro de Investigación en Ingeniería Matemática
- Universidad de Concepción
- French National Agency for Reasearch (ANR-10-BLANC-0218)
- FONDECYT (1131013)
This publication has 19 references indexed in Scilit:
- Two problems on independent sets in graphsDiscrete Mathematics, 2011
- A sharp upper bound for the number of stable sets in graphs with given number of cut edgesApplied Mathematics Letters, 2009
- Maximum Number of Fixed Points in Regulatory Boolean NetworksBulletin of Mathematical Biology, 2008
- The Emergence of Social Consensus in Boolean Networks2007
- Fixed points and maximal independent sets in AND–OR networksDiscrete Applied Mathematics, 2004
- An Entropy Approach to the Hard-Core Model on Bipartite GraphsCombinatorics, Probability and Computing, 2001
- DYNAMICAL BEHAVIOR OF KAUFFMAN NETWORKS WITH AND-OR GATESJournal of Biological Systems, 2000
- The Number of Maximal Independent Sets in Triangle-Free GraphsSIAM Journal on Discrete Mathematics, 1993
- The number of maximal independent sets in a connected graphDiscrete Mathematics, 1988
- The number of maximal independent sets in connected graphsJournal of Graph Theory, 1987