A breadth-first approach to memory-efficient graph search

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2006, Pages 1695-1698

  Zhou, Rong ^a   Hansen, Eric A ^b  

^a PALO ALTO RESEARCH CENTER   (United States)

^b MISSISSIPPI STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH-SEARCH ALGORITHMS; HEURISTIC SEARCH; MEMORY EFFICIENT GRAPH SEARCH; SOLUTION PATH;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; HEURISTIC METHODS; PROBLEM SOLVING; STORAGE ALLOCATION (COMPUTER);

GRAPH THEORY;

EID: 33750704571     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Hirschberg, D. 1975. A linear space algorithm for computing maximal common subsequences. Communications of the ACM 18(6):341-343.
2. Hohwald, H.; Thayer, I.; and Korf, R. 2003. Comparing best-first search and dynamic programming for optimal multiple sequence alignment. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-2003), 1239-1245.
3. Jensen, R.; Hansen, E.; Richards, S.; and Zhou, R. 2006. Memory-efficient symbolic heuristic search. In Proc. of the 16th Int. Conf. on Automated Planning and Scheduling (ICAPS-06).
4. Jensen, R.; Bryant, R.; and Veloso, M. 2002. SetA*: An efficient BDD-based heuristic search algorithm. In Proc. of the 18th National Conference on Artificial Intelligence (AAAI-02), 668-673.
5. Korf, R., and Zhang, W. 2000. Divide-and-conquer frontier search applied to optimal sequence alignment. In Proc. of the 17th National Conf. on Artificial Intelligence (AAAI-00), 910-916.
6. Korf, R.; Zhang, W.; Thayer, I.; and Hohwald, H. 2005. Frontier search. Journal of the ACM 52(5):715-748.
7. Korf, R. 1985. Depth-first iterative deepening: An optimal admissible tree search. Artificial Intelligence 27(1):97-109.
8. Korf, R. 1993. Linear-space best-first search. Artificial Intelligence 62(1):41-78.
9. Myers, E., and Miller, W. 1988. Optimal alignments in linear space. Computer Applications in the Biosciences 4(1):11-17.
10. Thayer, I. 2003. Methods for optimal multiple sequence alignment. Master's thesis, UCLA. Computer Sci. Dept.
11. Zhou, R., and Hansen, E. 2003a. Sparse-memory graph search. In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-03), 1259-1266.
12. Zhou, R., and Hansen, E. 2003b. Sweep A*: Space-efficient heuristic search in partially ordered graphs. In Proc. of the 15th IEEE Int. Conf. on Tools with Artif. Intell. (ICTAI-03), 427-434.
13. Zhou, R., and Hansen, E. 2004. Breadth-first heuristic search. In Proc. of the 14th International Conference on Automated Planning and Scheduling (ICAPS-04), 92-100.
14. Zhou, R., and Hansen, E. 2005. Beam-stack search: Integrating backtracking with beam search. In Proc. of the 15th Int. Conf. on Automated Planning and Scheduling (ICAPS-05), 90-98.
15. Zhou, R., and Hansen, E. 2006. Breadth-first heuristic search. Artificial Intelligence 170:385-408.