34 search results - page 5 / 7 » Compact Routing in Power-Law Graphs |
107
click to vote
MST
2010
15 years 1 months ago
2010
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
119
click to vote
ICNP
2007
IEEE
15 years 9 months ago
2007
IEEE
—Data structures representing directed graphs with edges labeled by symbols from a finite alphabet are used to implement packet processing algorithms used in a variety of network...
127
click to vote
SPAA
2005
ACM
15 years 8 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
139
click to vote
SPAA
2006
ACM
15 years 9 months ago
2006
ACM
One of the fundamental trade-offs in compact routing schemes is between the space used to store the routing table on each node and the stretch factor of the routing scheme – th...
212
click to vote
TAPAS
2011
14 years 10 months ago
2011
Every human likes choices. But today’s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative r...