Memory paging for connectivity and path problems in graphs.

Feuerstein, Esteban, and Marchetti-Spaccamela, Alberto. "Memory paging for connectivity and path problems in graphs.." Journal of Graph Algorithms and Applications 2 (1998): Paper No. 6, 22 p.-Paper No. 6, 22 p.. <http://eudml.org/doc/48068>.

@article{Feuerstein1998,
author = {Feuerstein, Esteban, Marchetti-Spaccamela, Alberto},
journal = {Journal of Graph Algorithms and Applications},
keywords = {paging problem; connectivity; query; memory; algorithms},
language = {eng},
pages = {Paper No. 6, 22 p.-Paper No. 6, 22 p.},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Memory paging for connectivity and path problems in graphs.},
url = {http://eudml.org/doc/48068},
volume = {2},
year = {1998},
}

TY - JOUR
AU - Feuerstein, Esteban
AU - Marchetti-Spaccamela, Alberto
TI - Memory paging for connectivity and path problems in graphs.
JO - Journal of Graph Algorithms and Applications
PY - 1998
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 2
SP - Paper No. 6, 22 p.
EP - Paper No. 6, 22 p.
LA - eng
KW - paging problem; connectivity; query; memory; algorithms
UR - http://eudml.org/doc/48068
ER -