Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Escaping a Grid by Edge-Disjoint Paths

Abstract

We present a technique for designing external memory data structures that support batched operations I/ O efficiently. We show how the technique can be used to develop external versions of a search tree, a priority queue, and a segment tree, and give examples of how these structures can be used to develop I/ O-efficient algorithms. The developed algorithms are either extremely simple or straightforward generalizations of known internal memory algorithms—given the developed external data structures.

This is a preview of subscription content, log in to check access.

Author information

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Chan, W., Chin, F.Y.L. & Ting, H. Escaping a Grid by Edge-Disjoint Paths . Algorithmica 36, 343–359 (2003). https://doi.org/10.1007/s00453-003-1023-8

Download citation

Keywords

  • Graph algorithm
  • Design and analysis of algorithm