2 papers
cond-mat.dis-nn2004
Core percolation and onset of complexity in Boolean networks
L. Correale, M. Leone, A. Pagnani +2
The determination and classification of fixed points of large Boolean networks is addressed in terms of constraint satisfaction problem. We develop a general simplification scheme…
cond-mat.dis-nn2003
Polynomial iterative algorithms for coloring and analyzing random graphs
A. Braunstein, R. Mulet, A. Pagnani +2
We study the graph coloring problem over random graphs of finite average connectivity . Given a number of available colors, we find that graphs with low connectivity admit a…