Fixed points and maximal independent sets in AND-OR networks

Discrete Applied Mathematics

Volumn 138, Issue 3, 2004, Pages 277-288

  Aracena, Julio ^a   Demongeot, Jacques ^b   Goles, Eric ^a  

^a UNIVERSITY OF CHILE   (Chile)

^b UNIV GRENOBLE ALPES   (France)

Author keywords

AND OR network; Bipartite graph; Digraph; Fixed point; Maximal independent set

Indexed keywords

BOOLEAN FUNCTIONS; BOUNDARY VALUE PROBLEMS; GRAPH THEORY; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

AND-OR NETWORKS; BIPARTITE GRAPHS; DIGRAPHS; FIXED POINTS; MAXIMAL INDEPENDENT SETS;

LOGIC CIRCUITS;

EID: 1642586056     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(03)00461-X     Document Type: Article

References (9)

1. Agur Z., Fraenkel A.S., Klein S.T. The number of fixed points of the majority rule. Discrete Math. 70:1988;295-302.
2. Goles E., Hernández G. Dynamical behavior of Kauffman networks with AND-OR gates. J. Biol. Systems. 8:2000;151-175.
3. Goles E., Martínez S. Neural and Automata Networks. Mathematics and its Applications Series. Vol. 58:1991;Kluwer, Dordrecht.
4. Hebb D.O. The Organization of Behavior. 1949;Wiley, New York.
5. Hopfield J.J. Neural networks and physical systems with emergent collective computational abilities. Proc. Natl. Acad. Sci. USA. 79:1982;2554-2558.
6. Kauffman S.A. Metabolic stability and epigenesis in randomly constructed genetics nets. J. Theoret. Biol. 22:1969;437-467.
7. Kauffman S.A. The Origins of Order, Self-Organization and Selection in Evolution. 1993;Oxford University Press, Oxford.
8. Litinskii L.B. On the computation of the fixed points of a neural network. Theoret. Math. Phys. 101(3):1994;1492-1501.
9. Liu J. Maximal independent sets in bipartite graphs. J. Graph Theory. 17:1993;495-507.