Skip to main content
Journal ArticleOPEN ACCESS

Local search with congestion in complex communication networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3038 1078-1085
DOI: 10.1007/978-3-540-24688-6_139
8Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © Springer-Verlag 2004.

Cite

CITATION STYLE

APA

Arenas, A., Danon, L., Díaz-Guilera, A., & Guimerà, R. (2004). Local search with congestion in complex communication networks. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3038, 1078–1085. https://doi.org/10.1007/978-3-540-24688-6_139

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free