Automata, Languages and Programming
From MaRDI portal
Publication:5466523
DOI10.1007/b99859zbMath1099.68513OpenAlexW2505584480MaRDI 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
Analysis of algorithms (68W40) Random graphs (graph-theoretic aspects) (05C80) Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)
Related Items (8)
Could any graph be turned into a small-world? ⋮ Eclecticism shrinks even small worlds ⋮ Distance estimation and object location via rings of neighbors ⋮ Depth of Field and Cautious-Greedy Routing in Social Networks ⋮ Recovering the long-range links in augmented graphs ⋮ Greedy routing in small-world networks with power-law degrees ⋮ Optimal routing in a small-world network ⋮ Universal augmentation schemes for network navigability
This page was built for publication: Automata, Languages and Programming