Escaping a Grid by Edge-Disjoint Paths |
| |
| Authors: | Wun-Tat Chan Francis Y L Chin and Hing-Fung Ting |
| |
| Affiliation: | (1) Department of Computer Science and Information Systems, The University of Hong Kong, Pokfulam Road, Hong Kong. wtchan@csis.hku.hk, chin@csis.hku.hk, hfting@csis.hku.hk., HK |
| |
| Abstract: | 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. |
| |
| Keywords: | , Graph algorithm, Design and analysis of algorithm, |
| 本文献已被 SpringerLink 等数据库收录！ |
|
