DFS-traversing graphs in a paging environment, LRU or MRU! (Q1183469)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: DFS-traversing graphs in a paging environment, LRU or MRU! |
scientific article; zbMATH DE number 33313
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | DFS-traversing graphs in a paging environment, LRU or MRU! |
scientific article; zbMATH DE number 33313 |
Statements
DFS-traversing graphs in a paging environment, LRU or MRU! (English)
0 references
28 June 1992
0 references
I/O complexity
0 references
depth-first search
0 references
buffer replacement strategy
0 references
performance evaluation
0 references
