A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Graph data in modern scientific and engineering applications are often too large to fit in the computer's main memory. Input/output (I/O) complexity is a major research issue in this context. Minimization of the number of I/O operations (in external memory graph algorithms) is the main focus of current research while classical (internal memory) graph algorithms were designed to minimize temporal complexity. In this paper, we propose an external memory depth first search algorithm for generaldoi:10.1016/j.tcs.2006.12.022 fatcat:wnhms3ejwfcizbqpq4m7iscdqy