A Graph Search Heuristic for Shortest Distance Paths
Conference
·
OSTI ID:862393
This paper presents a heuristic for guiding A* search for finding the shortest distance path between two vertices in a connected, undirected, and explicitly stored graph. The heuristic requires a small amount of data to be stored at each vertex. The heuristic has application to quickly detecting relationships between two vertices in a large information or knowledge network. We compare the performance of this heuristic with breadth-first search on graphs with various topological properties. The results show that one or more orders of magnitude improvement in the number of vertices expanded is possible for large graphs, including Poisson random graphs.
- Research Organization:
- Lawrence Livermore National Laboratory (LLNL), Livermore, CA
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 862393
- Report Number(s):
- UCRL-CONF-210878
- Country of Publication:
- United States
- Language:
- English
Similar Records
Fast estimation of diameter and shortest paths (without matrix multiplication)
The d-edge shortest-path problem for a Monge graph
Fully dynamic output bounded single source shortest path problem
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:416840
The d-edge shortest-path problem for a Monge graph
Conference
·
Tue Jul 14 00:00:00 EDT 1992
·
OSTI ID:10146169
Fully dynamic output bounded single source shortest path problem
Conference
·
Mon Dec 30 23:00:00 EST 1996
·
OSTI ID:416803