Edge partitioning in external-memory graph search

Authors:
Rong Zhou;Eric A. Hansen
Affiliations:
Palo Alto Research Center, Palo Alto, CA;Dept. of Computer Science and Eng., Mississippi State University, MS
Venue:
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Year:
2007

Citing 8
Cited 5

I/O-complexity of graph algorithms

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Using Magnatic Disk Instead of Main Memory in the Murphi Verifier

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Breadth-first heuristic search

Artificial Intelligence
Best-first frontier search with delayed duplicate detection

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Structured duplicate detection in external-memory graph search

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Domain-independent structured duplicate detection

AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Large-scale parallel breadth-first search

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
External-memory pattern databases using structured duplicate detection

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3

Dynamic Delayed Duplicate Detection for External Memory Model Checking

SPIN '08 Proceedings of the 15th international workshop on Model Checking Software
Linear-time disk-based implicit graph search

Journal of the ACM (JACM)
Parallel structured duplicate detection

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Leveraging graph locality via abstraction

SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Best-first heuristic search for multicore machines

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

There is currently much interest in using external memory, such as disk storage, to scale up graph-search algorithms. Recent work shows that the local structure of a graph can be leveraged to substantially improve the efficiency of external-memory graph search. This paper introduces a technique, called edge partitioning, which exploits a form of local structure that has not been considered in previous work. The new technique improves the scalability of structured approaches to external-memory graph search, and also guarantees the applicability of these approaches to any graph-search problem. We show its effectiveness in an external-memory graph-search algorithm for domain-independent STRIPS planning.