Documents Related by Co-Citation

33 On External Memory MST, SSSP and Multi-way Planar Graph Separation (Extended Abstract) – Lars Arge, Gerth Stølting Brodal, Laura Toma - 2000
18 External memory algorithms for outerplanar graphs – Anil Maheshwari, Norbert Zeh - 1999
75 Improved Algorithms and Data Structures for Solving Graph Problems in External Memory – Vijay Kumar, Eric J. Schwabe - 1996
175 External-Memory Graph Algorithms – Yi-Jen Chiang , Michael T. Goodrich, Edward F. Grove, Roberto Tamassia, Darren Erik Vengroff, Jeffrey Scott Vitter - 1995
90 A Functional Approach to External Graph Algorithms – James Abello, Adam L. Buchsbaum, Jeffery R. Westbrook - 1998
15 External Memory BFS on Undirected Graphs with Bounded Degree – Ulrich Meyer - 2001
236 Algorithms for Parallel Memory I: Two-Level Memories – Jeffrey Scott Vitter, Elizabeth A.M. Shriver - 1992
24 On External-Memory Planar Depth First Search – Lars Arge, Ulrich Meyer, Laura Toma, Norbert Zeh
17 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
15 Parallel algorithms in graph theory: Planarity testing – J Ja'Ja', J Simon - 1980
30 Planarity testing in parallel – V Ramachandran, J Reif - 1994
35 On the Embedding Phase of the Hopcroft and Tarjan Planarity Testing Algorithm – Kurt Mehlhorn, Petra Mutzel - 1994
23 An external memory data structure for shortest path queries (Extended Abstract) – David Hutchinson, Anil Maheshwari, Norbert Zeh - 2003
230 Efficient planarity testing – J E Hopcroft, R E Tarjan - 1974
121 Parallel Tree Contraction and its Application – G L Miller, J H Reif - 1985
996 Depth first search and linear graph algorithms – Robert Tarjan - 1972
178 Dividing a graph into triconnected components – J E Hopcroft, R E Tarjan - 1973
473 Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms – K Booth, G Lueker - 1976
108 An algorithm for planarity testing of graphs – A Lempel, S Even, I Cederbaum - 1966