A caching approach to reduce communication in graph search algorithms.
Pietro CicottiLaura CarringtonPublished in: DISCS@SC (2014)
Keyphrases
- search algorithm
- graph search
- random walk
- heuristic search
- graph model
- branch and bound
- communication networks
- graph structure
- query processing
- graph theoretic
- prefetching
- spanning tree
- communication systems
- image segmentation
- path finding
- communication channels
- graph databases
- directed acyclic graph
- communication cost
- selection algorithm
- structured data
- sensor networks
- mobile robot