126 search results - page 14 / 26 » More Algorithms for All-Pairs Shortest Paths in Weighted Gra... |
WSDM
2010
ACM
14 years 5 months ago
2010
ACM
We study the fundamental problem of computing distances between nodes in large graphs such as the web graph and social networks. Our objective is to be able to answer distance que...
FOCS
2003
IEEE
14 years 26 days ago
2003
IEEE
A directed multigraph is said to be d-regular if the indegree and outdegree of every vertex is exactly d. By Hall’s theorem one can represent such a multigraph as a combination ...
WEA
2007
Springer
14 years 1 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
IWDC
2005
Springer
14 years 1 months ago
2005
Springer
For a connected graph, representing a sensor network, distributed algorithms for the Set Covering Problem can be employed to construct reasonably small subsets of the nodes, calle...
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...