Local search with congestion in complex communication networks
Times cited: 12
Arenas, A, Danon, L, Diaz-Guilera, A, Guimera, R.
LECT NOTE COMPUT SCI 3038 , 1078 -1085 (2004).
We present a formalism that is able to cope with search and congestion simultaneously. This formalism avoids the problem of simulating the dynamics of the search-communication process which turns out to be impracticable, specially close to the congestion point where search costs (time) diverge.