Skip to main content
Conference Proceedings

Memory paging for connectivity and path problems in graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1993) 762 LNCS 416-425
DOI: 10.1007/3-540-57568-5_273
10Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Feuerstein, E., & Marchetti-Spaccamela, A. (1993). Memory paging for connectivity and path problems in graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 762 LNCS, pp. 416–425). Springer Verlag. https://doi.org/10.1007/3-540-57568-5_273

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free