{"type":"ScholarlyArticle","title":"Edge Partitioning in External-Memory Graph Search","authors":[{"name":"Rong Zhou","slug":"rong-zhou","given":"Rong","family":"Zhou","affiliation":""},{"name":"Eric A. Hansen","slug":"eric-a-hansen","given":"Eric A.","family":"Hansen","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2007/388","pdf":"https://ijcai.org/proceedings/2007/0388.pdf","markdown":"https://ijcai.org/proceedings/2007/388.md","bibtex":"https://ijcai.org/proceedings/2007/bibtex/388","volume":{"slug":"2007","title":"Proceedings of the Twentieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2007","url":"https://ijcai.org/proceedings/2007/","year":2007,"location":"Hyderabad, India","dates":"","editors":"Ramon López de Mántaras","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":388,"pages":{"first":2410,"last":2416},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}