CORR
2007
Springer
13 years 4 months ago
2007
Springer
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to mee...
ALENEX
2010
13 years 5 months ago
2010
Small-world experiments in which packages reach addressees unknown to the original sender through a forwarding chain confirm that acquaintance networks have short paths, a propert...
ESA
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. Social networks are navigable small worlds, in which two arbitrary people are likely connected by a short path of intermediate friends that can be found by a "decent...
ICC
2008
IEEE
13 years 10 months ago
2008
IEEE
Abstract— Underlay topology information is important to construct efficient overlay networks. To achieve end-to-end network topology inference among a group of hosts, traceroute...