313 search results - page 16 / 63 » Shortest Paths in Distance-regular Graphs |
DC
2002
13 years 7 months ago
2002
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
In this paper, we present a localized Shortest Path Tree (SPT) based algorithm for constructing a sub-network with the minimum-energy property for a given wireless ad hoc network....
ALT
2007
Springer
14 years 4 months ago
2007
Springer
We consider the problem of learning and verifying hidden graphs and their properties given query access to the graphs. We analyze various queries (edge detection, edge counting, sh...
KDD
2004
ACM
14 years 27 days ago
2004
ACM
Many real-world graphs have been shown to be scale-free— vertex degrees follow power law distributions, vertices tend to cluster, and the average length of all shortest paths is...
BIRTHDAY
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...