Heuristics for semi-external depth first search on directed graphs

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2002, Pages 282-292

  Sibeyn, Jop F ^a   Abello, James ^b   Meyer, Ulrich ^c  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

^b AT AND T LABS RESEARCH   (United States)

^c MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Depth first search; External memory; Graph algorithms; Strong components

Indexed keywords

C (PROGRAMMING LANGUAGE); COMPUTER SIMULATION; DATA STORAGE EQUIPMENT; GRAPH THEORY; HEURISTIC PROGRAMMING; OPTIMIZATION;

DEPTH FIRST SEARCH; DIRECTED GRAPHS;

ALGORITHMS;

EID: 0036954318     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/564870.564917     Document Type: Conference Paper

References (21)

1. Aggarwal, A., R.J. Anderson, 'A Random NC Algorithm for Depth First Search,' Cominatorica, 8(1), pp. 1-12, 1988.
2. Aggarwal, A., J.S. Vitter, 'The Input/Output Complexity of Sorting and Related Problems,' Comm. of the ACM, 31(9), pp. 1116-1127, 1988.
3. Alon, N., J. H. Spencer, P. Erdös, The Probabilistic Method, John Wiley and Sons, 1992.
4. Arge, L., U. Meyer, L. Toma, N. Zeh 'On External-Memory Planar Depth First Search,' Proc. 7th Workshop on Algorithms and Data Structures, pp. 471-482, LNCS 2125, Springer-Verlag, 2001.
5. Bollobás, B., Random Graphs, Academic Press, London, 1985.
6. Broder, A., R. Kumar, F. Maghoul, P. Raghavan, S. Rajagopalan, R. Stata and A. Tomkins, J. Wiener, 'Graph Structure in the Web,' Computer Networks, Vol. 33, pp. 309-320, June 2000.
7. Buchsbaum, A.L., M. Goldwasser, S. Venkatasubramanian, J.R. Westbrook, 'On External Memory Graph Traversal,' Proc. 11th Symp. on Discrete Algorithms, ACM-SIAM, 2000.
8. Chiang, Y-J, M.T. Goodrich, E.F. Grove, R. Tamassia, D.E. Vengroff, J.S. Vitter. 'External-Memory Graph Algorithms,' Proc. 6th Symp. on Discrete Algorithms, pp. 139-149, ACM-SIAM, 1995.
9. Cooper, C., A. Frieze, 'A General Model of Undirected Web Graphs,' Proc. Intern. Colloquium on Automata, Languages and Programming, LNCS 2161, pp. 500-512, Springer, 2001.
10. 2,' Intern. Workshop on Randomization and Approximation Techniques in Computer Science, LNCS 1518, pp. 294-306, Springer-Verlag, 1998.
11. Hwang, F.K., D.S. Richards, P. Winter, The Steiner Tree Problem, Annals of Discrete Mathematics, 53, North-Holland, Amsterdam, 1992.
12. Kapidakis, S., Average-Case Analysis of Graph- Searching Algorithms, PhD. Thesis, Department of Computer Science, Princeton University, 1990.
13. Koch, T., A. Martin, 'Solving Steiner Tree Problems in Graphs to Optimality,' Networks, 32, pp. 207-232, 1998.
14. Kumar, V., E. J. Schwabe, 'Improved Algorithms and Data Structures for Solving Graph Problems in External Memory,' Proc. 8th Symp. on Parallel and Distributed Processing, pp. 169-177, IEEE, 1996.
15. Maheshwari, A., N. Zeh, 'External Memory Algorithms for Outerplanar Graphs,' Proc. 10th Intern. Symp. on Algorithms and Computation, LNCS 1741, pp. 307-316, Springer-Verlag, 1999.
16. Maheshwari, A., N. Zeh, 'I/O-Efficient Algorithms for Graphs of Bounded Treewidth,' Proc. 12th Symp. on Discrete Algorithms, pp. 89-90, ACM-SIAM, 2001.
17. Maheshwari, A., N. Zeh, 'I/O-Optimal Algorithms for Planar Graphs Using Separators,' Proc. 13th Symp. on Discrete Algorithms, pp. 372-381, ACM-SIAM, 2002.
18. Meyer, U., 'External Memory BFS on Undirected Graphs with Bounded Degree,' Proc. 12th Symp. on Discrete Algorithms, pp. 87-88, ACM-SIAM, 2001.
19. Polzin, T., S. Vahdati Daneshmand, 'Improved Algorithms for the Steiner Problem in Networks,' Discrete Applied Mathematics, 112, pp. 263-300, 2001.
20. Sleator, D.D., R.E. Tarjan, 'A Data Structure for Dynamic Trees,' Journal of Computer and System Sciences, 26(3), pp. 362-391, 1983.
21. Sleator, D.D., R.E. Tarjan, 'Self-Adjusting Binary Search Trees,' Journal of the ACM, 32(3), pp. 652-686, 1985.