DFS-traversing graphs in a paging environment, LRU or MRU?☆
References (2)
Traversing graphs in a paging environment, BFS on DFS?
Inform. Process. Lett.
(1991)Depth-first search and linear graph algorithms
SIAM J. Comput.
(1972)
Cited by (2)
Caching for web searching
2002, Algorithmica (New York)Caching for web searching
2000, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
- ☆
This note can be considered as a continuation of the discussion presented in [1].
Copyright © 1991 Published by Elsevier B.V.