article · 2003

I/O-Efficient Topological Sorting of Planar DAGs

Lars Arge, et al.

Cited by 0Abstract and details only

Abstract

We present algorithms that solve a number of fundamental problems on planar directed graphs (planar digraphs) in O(sort(N)) I/Os, where sort(N) is the number of I/Os needed to sort N elements. The problems we consider are breadth-first search, the single-source shortest path problem, computing a directed ear decomposition of a strongly connected planar digraph, computing an open directed ear decomposition of a strongly connected biconnected planar digraph, and topologically sorting a planar directed acyclic graph.

Cite this paper

APA 7

Lars Arge, E. A. (2003). I/O-Efficient Topological Sorting of Planar DAGs.

MLA 9

Lars Arge, et al. “I/O-Efficient Topological Sorting of Planar DAGs.” 2003.

Chicago

Lars Arge, et al. 2003. “I/O-Efficient Topological Sorting of Planar DAGs.”

Harvard

Lars Arge, E.A. (2003) ‘I/O-Efficient Topological Sorting of Planar DAGs’.

BibTeX

@article{larsarge2003efficient,
  title = {{I/O-Efficient Topological Sorting of Planar DAGs}},
  author = {Lars Arge, et al.},
  year = {2003}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.