|
226
|
Algorithms for Parallel Memory I: Two-Level Memories
– Jeffrey Scott Vitter, Elizabeth A.M. Shriver
- 1992
|
|
30
|
On External Memory MST, SSSP and Multi-way Planar Graph Separation (Extended Abstract)
– Lars Arge, Gerth Stølting Brodal, Laura Toma
- 2000
|
|
17
|
External memory algorithms for outerplanar graphs
– Anil Maheshwari, Norbert Zeh
- 1999
|
|
22
|
On External-Memory Planar Depth First Search
– Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
|
|
13
|
External Memory BFS on Undirected Graphs with Bounded Degree
– Ulrich Meyer
- 2001
|
|
159
|
External-Memory Graph Algorithms
– Yi-Jen Chiang , Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, Jeffrey Scott Vitter
- 1995
|
|
81
|
A Functional Approach to External Graph Algorithms
– James Abello, Adam L. Buchsbaum, Jeffery R. Westbrook
- 1998
|
|
71
|
Improved Algorithms and Data Structures for Solving Graph Problems in External Memory
– Vijay Kumar, Eric J. Schwabe
- 1996
|
|
59
|
I/O-Complexity of Graph Algorithms
– Kameshwar Munagala, Abhiram Ranade
- 1999
|
|
21
|
An external memory data structure for shortest path queries (Extended Abstract)
– David Hutchinson, Anil Maheshwari, Norbert Zeh
- 2003
|
|
20
|
Efficient Parallel Algorithms for Planar
– P Klein
- 1988
|
|
28
|
On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm
– Kurt Mehlhorn, Petra Mutzel
- 1994
|
|
14
|
Parallel algorithms in graph theory: planarity testing
– J JáJá, J Simon
- 1982
|
|
20
|
Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus
– L. Aleksandrov, H. Djidjev
- 1996
|
|
15
|
I/O-efficient algorithms for contour-line extraction and planar graph blocking (Extended Abstract)
– Pankaj K. Agarwal, Lars Arge, T. M. Murali, Kasturi R. Varadarajan, Jeffrey Scott Vitter
- 1998
|
|
24
|
Planarity testing in parallel
– V Ramachandran, J H Reif
- 1990
|
|
117
|
Parallel tree contraction and its application
– G L Miller, J H Reif
- 1985
|
|
801
|
Depth-first search and linear graph algorithms
– R Tarjan
- 1972
|
|
140
|
Dividing a Graph into Triconnected Components
– E, Robert E Tarjan
- 1973
|
