I/O-Efficient Algorithms for Problems on Grid-Based Terrains

DOI10.1145/945394.945395zbMath1085.68739OpenAlexW2083801185MaRDI QIDQ5463423

Lars Arge, Laura Toma, Jeffrey Scott Vitter

Publication date: 4 August 2005

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: http://www.jea.acm.org/2001/ArgeIO/

zbMATH Keywords

connected componentsflowexperimental algorithmsI/O modelI/O efficientgrid based terrainsshortes paths

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Related Items

External-memory depth-first search algorithm for solid grid graphs ⋮ An external-memory depth-first search algorithm for general grid graphs

This page was built for publication: I/O-Efficient Algorithms for Problems on Grid-Based Terrains