{"type":"ScholarlyArticle","title":"Sparse-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":"We describe a framework for reducing the space complexity of graph search algorithms such as A* that use Open and Closed lists to keep track of the frontier and interior nodes of the search space. We propose a sparse representation of the Closed list in which only a fraction of already expanded nodes need to be stored to perform the two functions of the Closed List- preventing duplicate search effort and allowing solution extraction. Our proposal is related to earlier work on search algorithms that do not use a Closed list at all [Korf and Zhang, 2000]. However, the approach we describe has several advantages that make it effective for a wider variety of problems.","doi":null,"url":"https://ijcai.org/proceedings/2003/179","pdf":"https://ijcai.org/proceedings/2003/0179.pdf","markdown":"https://ijcai.org/proceedings/2003/179.md","bibtex":"https://ijcai.org/proceedings/2003/bibtex/179","volume":{"slug":"2003","title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2003","url":"https://ijcai.org/proceedings/2003/","year":2003,"location":"Acapulco, Mexico","dates":"","editors":"Georg Gottlob","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":179,"pages":{"first":1259,"last":1267},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}