Traversing graphs in a paging environment, BFS or DFS? (Q751281)
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: Traversing graphs in a paging environment, BFS or DFS? |
scientific article; zbMATH DE number 4176454
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Traversing graphs in a paging environment, BFS or DFS? |
scientific article; zbMATH DE number 4176454 |
Statements
Traversing graphs in a paging environment, BFS or DFS? (English)
0 references
1991
0 references
I/O-complexity
0 references
breadth-first search
0 references
depth-first search
0 references
performance evaluation
0 references
