Heuristics for Semi-External Depth First Search on Directed Graphs

Sibeyn, Jop F.; Abello, James; Meyer, Ulrich

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Heuristics for Semi-External Depth First Search on Directed Graphs

MPS-Authors

/persons/resource/persons45038

Meyer, Ulrich
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Sibeyn, J. F., Abello, J., & Meyer, U. (2002). Heuristics for Semi-External Depth First Search on Directed Graphs. In SPAA 2002: Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures (pp. 282-292). New York, USA: ACM.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2FAF-0

Abstract

Computing the strong components of a directed graph is an essential operation for a basic structural analysis of it. This problem can be solved by twice running a depth-first search (DFS). In an external setting, in which all data can no longer be stored in the main memory, the DFS problem is unsolved so far. Assuming that node-related data can be stored internally, semi-external computing does not make the problem substantially easier. Considering the definite need to analyze very large graphs, we have developed a set of heuristics which together allow the performance of semi-external DFS for directed graphs in practice. The heuristics have been applied to graphs with very different graph properties, including ``web graphs'' as described in the most recent literature and some call graphs from ATT. Depending on the graph structure, the program is between 10 and 200 times faster than the best alternative, a factor that will further increase with future technological developments.