Linear-time disk-based implicit graph search

Journal of the ACM

Volumn 55, Issue 6, 2008, Pages

  Korf, Richard E ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

External memory; Magnetic disk storage; Permutation encodings; Rubik's Cube; Sliding tile puzzles; Towers of Hanoi

Indexed keywords

EXTERNAL MEMORY; PERMUTATION ENCODINGS; RUBIK'S CUBE; SLIDING-TILE PUZZLES; TOWERS OF HANOI;

BUILDINGS; COMPUTATIONAL METHODS; DATA STORAGE EQUIPMENT; DATABASE SYSTEMS; DISKS (MACHINE COMPONENTS); DISKS (STRUCTURAL COMPONENTS); ENCODING (SYMBOLS); HEURISTIC METHODS; LEARNING ALGORITHMS; MAGNETIC MATERIALS; MAGNETIC STORAGE; NONVOLATILE STORAGE; POLYETHYLENE GLYCOLS; SEMICONDUCTOR STORAGE; TOWERS;

MAGNETIC DISK STORAGE;

EID: 57949111257     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1455248.1455250     Document Type: Article

References (45)

1. AJWANI, D., DEMENTIEV, R., AND MEYER, U. 2006, A computational study of external-memory bfs algorithms. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA '06). ACM, New York, 601-610.
2. BAO, T., AND JONES, M. 2005. Time-efficient model checking with magnetic disk. In Proceedings of the 11th International Conference on Tools and Algorithms for the Construction and Analysis of Systems(TACAS). Lecture Notes in Computer Science, vol. 3440. Springer-Verlag, New York, 526-540.
3. BODE, J.-P., AND HINZ, A. 1999. Results and open problems on the Tower of Hanoi. In Proceedings of the 30th Southeastern International Conference on Combinatorics, Graph Theory, and Computing.
4. BONET, B. 2008. Efficient algorithms to rank and unrank permutations in lexicographic order. In Proceedings of the 1st International Symposium on Search Techniques in AI and Robotics. Chicago, IL.
5. BRUNGGER, A., MARZETTA, A., FUKUDA, K., AND NIEVERGELT, J. 1999. The parallel search bench ZRAM and its applications. Ann. Oper. Res. 90, 45-63.
6. CULBERSON, J., AND SCHAEFFER, J. 1998. Pattern databases. Computat. Intell. 14, 3, 318-334.
7. DIJKSTRA, E. 1959. A note on two problems in connexion with graphs. Numer. Math. 1, 269-271.
8. EDELKAMP, S., JABBAR, S., AND SCHROEDL, S. 2004. External A*. In Proceedings of the 27th German Conference on Artificial Intelligence. Lecture Notes in Artificial Intelligence, vol. 3238, Springer-Verlag, New York, 226-240.
9. FELNER, A., KORF, R. E., MESHULAM, R., AND HOLTE, R. C. 2007. Compressed pattern databases. J. Artif. Intell. Res. 30 (Oct.), 213-247.
10. FIAT, A., MOSES, S., SHAMIR, A., SHIMSHONI, I., AND TARDOS, G. 1989. Planning and learning in permutation groups. In Proceedings of the 30th ACM Foundations of Computer Science Conference (FOCS). ACM, New York, 274-279.
11. FRAME, J. 1941. Solution to advanced problem 3918. Amer. Math. Monthly 48, 216-217.
12. GARCIA-MOLINA, H., ULLMAN, J. D., AND WIDOM, J. 2000. Database System Implementation. Prentice-Hall, Englewood Cliffs, NJ.
13. HART, P., NILSSON, N., AND RAPHAEL, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cyber. SSC-4, 2 (July), 100-107.
14. HINZ, A. M. 1997. The Tower of Hanoi. In Algebras and Combinatorics: Proceedings of ICAC'97. Springer-Verlag, New York, 277-289.
15. JOHNSON, W., AND STOREY, W. 1879. Notes on the 15 Puzzle. Amer. J. Math. 2, 397-404.
16. KATRIEL, I., AND MEYER, U. 2003. Elementary graph algorithms in external memory. In Algorithms for Memory Hierarchies. Lecture Notes in Computer Science, vol. 2625. Springer-Verlag, New York, 62-84.
17. KORF, R. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artif. Intell. 27, 1, 97-109.
18. KORF, R. 1997. Finding optimal solutions to Rubik's cube using pattern databases. In Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-97). AAAI Press, Menlo Park, CA, 700-705.
19. KORF, R. 2003a. Breadth-first frontier search with delayed duplicate detection. In Proceedings of the IJCAI03 Workshop on Model Checking and Artificial Intelligence. http://www.ijcai.org, 87-92.
20. KORF, R. 2003b. Delayed duplicate detection: Extended abstract. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-03). http://www.ijcai.org, 1539-1541.
21. KORF, R. 2004. Best-first frontier search with delayed duplicate detection. In Proceedings of the National Conference on Artificial Intelligence (AAAI-2004). AAAI Press, Menlo Park, CA, 650-657.
22. KORF, R. 2008. Minimizing disk I/O in two-bit breadth-first search. In Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI-2008). AAAI Press, Menlo Park, CA.
23. KORF, R., AND FELNER, A. 2002. Disjoint pattern database heuristics. Artif. Intell. 134, 1-2 (Jan), 9-22.
24. KORF, R., AND FELNER, A. 2007. Recent progress in heuristic search: A case study of the four-peg towers of hanoi problem. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-07). http://www.ijcai.org, 2334-2329.
25. KORF, R., AND SHULTZE, P. 2005. Large-scale, parallel breadth-first search. In Proceedings of the 20th AAAI Conference on Artificial Intelligence. AAAI Press, Menlo Park, CA, 1380-1385.
26. KORF, R., ZHANG, W., THAYER, I., AND HOHWALD, H. 2005. Frontier search. JACM 52, 5 (Sept.), 715-748.
27. KUNKLE, D., AND COOPERMAN, G. 2007. Twenty-six moves suffice for Rubik's cube. In Proceedings of the 32nd International Symposium on Symbolic and Algebraic Computation (ISSAC'07). ACM, New York, 235-242.
28. MEHLHORN, K., AND MEYER, U. 2002. External memory breadth-first search with sublinear I/O. In Proceedings of the 10th European Symposium, on Algorithms (ESA). Lecture Notes in Computer Science, vol. 2461. Springer-Verlag, New York, 723-735.
29. MEYER, U. 2001. External memory bfs on undirected graphs with bounded degree. In Proceedings of the 12th Annual Symposium on Discrete Algorithms. ACM-SIAM, New York, 87-88.
30. MUNAGALA, K., AND RANADE, A. 1999. I/O complexity of graph algorithms. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). ACM, New York, 687-694.
31. MYRVOLD, W., AND RUSKEY, F. 2001. Ranking and unranking permutations in linear time. Inf. Proc. Lett. 79, 281-284.
32. NICHOLS, B., BUTLER, D., AND FARRELL, J. 1996. Pthreads Programming. O'Reilly.
33. NIEWIADOMSKI, R., AMARAL, J., AND HOLTE, R. 2006. Sequential and parallel algorithms for frontier a* with delayed duplicate detection. In Proceedings of the National Conference on Artificial Intelligence (AAAI-2006). AAAI Press, Menlo Park, CA, 1039-1044.
34. PATTERSON, D., GIBSON, G., AND KATZ, R. 1988. A case for redundant arrays of inexpensive disks. In SIGMOD. ACM, New York, 109-116.
35. PENNA, G. D., INTRIGILA, B., TONCI, E., AND ZILLI, M. V. 2002. Exploiting transition locality in the disk based mur(phi) verifier. In Proceedings of the 4th International Conference on Formel Methods in Computer-Aided Design. Lecture Notes in Computer Science, vol. 2517. Springer-Verlag, New York, 202-219.
36. ROSCOE, A. 1994. Model-checking csp. In A Classical Mind, Essays in Honour of CAR Hoare, A. Roscoe, Ed. Prentice-Hall, Englewood Cliffs, NJ.
37. STERN, U., AND DILL, D. 1998. Using magnetic disk instead of main memory in the mur(phi) verifier. In Proceedings of the 10th International Conference on Computer-Aided Verification. 172-183.
38. STEWART, B. 1941. Solution to advanced problem 3918. Amer. Math. Monthly 48, 217-219.
39. ZHOU, R., AND HANSEN, E. 2003. Sparse-memory graph search. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-03). http://www.ijcai.org, 1259-1266.
40. ZHOU, R., AND HANSEN, E. 2004. Structured duplicate detection in external-memory graph search. In Proceedings of the National Conference on Artificial Intelligence (AAAI-2004). AAAI Press, Menlo Park, CA, 683-688.
41. ZHOU, R., AND HANSEN, E. 2005. External memory pattern databases using structured duplicate detection. In Proceedings of the National Conference on Artificial Intelligence (AAAI-2005). AAAI Press, Menlo Park, CA, 1398-1404.
42. ZHOU, R., AND HANSEN, E. 2006a. Breadth-first heuristic search. Artifi Intell. 170, 4-5, 385-408.
43. ZHOU, R., AND HANSEN, E. 2006b. Domain-independent structured duplicate detection. In Proceedings of the National Conference on Artificial Intelligence (AAAI-2006). AAAI Press, Menlo Park, CA, 1082-1087.
44. ZHOU, R., AND HANSEN, E. 2007a. Edge partitioning in external-memory graph search. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-07). http://www.ijcai.org, 2410-2416.
45. ZHOU, R., AND HANSEN, E. 2007b. Parallel structured duplicate detection. In Proceedings of the National Conference on Artificial Intelligence (AAAI-2007). AAAI Press, Menlo Park, CA, 1217-1223.