Summary: I/O-EÆcient Topological Sorting of Planar DAGs 
Lars Arge
Dept. of Computer Science
Duke University
Durham, NC 27708-0129
large@cs.duke.edu
Laura Toma
Dept. of Computer Science
Duke University
Durham, NC 27708-0129
laura@cs.duke.edu
Norbert Zeh
Dept. of Computer Science
Duke University
Durham, NC 27708-0129
nzeh@cs.duke.edu
ABSTRACT
We present algorithms that solve a number of fundamen-
tal problems on planar directed graphs (planar digraphs)
in O(sort(N)) I/Os, where sort(N) is the number of I/Os

Source: Arge, Lars - Department of Computer Science, Aarhus Universitet

Collections: Computer Technologies and Information Sciences