Memory Paging for Connectivity and Path Problems in Graphs

DOI10.7155/JGAA.00009MaRDI QIDQ4215724zbMATH OpenOpenAlexFDO

Authors E. Feuerstein, Alberto Marchetti-Spaccamela

Publication date 28 October 1998

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/48068

zbMATH Keywords

algorithmsconnectivitymemorypaging problemquery

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Strongly Competitive Algorithms for Paging with Locality of Reference
• scientific article; zbMATH DE number 742969
• scientific article; zbMATH DE number 2079385

Cited in

(4)

• Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep versus plane sweep
• scientific article; zbMATH DE number 4201604 (Why is no real title available?)
• Algorithms for Page Retrieval and Hamiltonian Paths on Forward-Convex Line Graphs
• Experiments on the practical I/O efficiency of geometric algorithms: Distribution sweep vs. plane sweep

This page was built for publication: Memory Paging for Connectivity and Path Problems in Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4215724)