Automata, Languages and Programming
From MaRDI portal
Publication:5466523
DOI10.1007/b99859zbMath1099.68513MaRDI QIDQ5466523
Nicolas Schabanel, Emmanuelle Lebhar
Publication date: 24 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99859
68W40: Analysis of algorithms
05C80: Random graphs (graph-theoretic aspects)
68W05: Nonnumerical algorithms
68M10: Network design and communication in computer systems
68R10: Graph theory (including graph drawing) in computer science
Related Items
Depth of Field and Cautious-Greedy Routing in Social Networks, Recovering the long-range links in augmented graphs, Universal augmentation schemes for network navigability, Distance estimation and object location via rings of neighbors, Greedy routing in small-world networks with power-law degrees, Could any graph be turned into a small-world?, Eclecticism shrinks even small worlds, Optimal routing in a small-world network