Paulo R A Campos1, F G Brady Moreira
1Departamento de Física e Matemática, Universidade Federal Rural de Pernambuco, Dois Irmãos 52171-900, Recife-Pernambuco, Brazil. prac@ufrpe.br
You might also read
Articles linked to this work by shared authors, journal, and citation graph.
Adaptive walks on complex networks show that local optima decrease with connectivity. Mean walk length on random graphs approaches a constant, while scale-free networks exhibit an upper bound.
Area of Science:
Background:
Purpose of the Study:
Main Methods:
Main Results:
Conclusions: