Escaping a Grid by Edge-Disjoint Paths


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… (More)
DOI: 10.1007/s00453-003-1023-8


7 Figures and Tables

Cite this paper

@article{Chan2000EscapingAG, title={Escaping a Grid by Edge-Disjoint Paths}, author={Wun-Tat Chan and Francis Y. L. Chin and Hing-Fung Ting}, journal={Algorithmica}, year={2000}, volume={36}, pages={343-359} }