Traversing graphs in a paging environment, BFS or DFS?
From MaRDI portal
Publication:751281
DOI10.1016/0020-0190(91)90034-FzbMath0714.68042MaRDI QIDQ751281
Publication date: 1991
Published in: Information Processing Letters (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)
Related Items
DFS-traversing graphs in a paging environment, LRU or MRU!, I/O- and CPU-optimal recognition of strongly connected components
Cites Work