Data sets in large applications are often too massive to fit completely inside the computers
internal memory. The resulting input/output communication (or I/O) between fast internal …

Data sets in large applications are often too massive to fit completely inside the computer's
internal memory. The resulting input/output communication (or I/O) between fast internal …

To exploit the similarity information hidden in the hyperlink structure of the web, this paper
introduces algorithms scalable to graphs with billions of vertices on a distributed …

Abstract Let G=(V, E) be an undirected weighted graph on| V|= n vertices and| E|= m edges.
A t‐spanner of the graph G, for any t≥ 1, is a subgraph (V, ES), ES⊆ E, such that the …

We present the software library Stxxl that is an implementation of the C++ standard template
library (STL) for processing huge data sets that can fit only on hard disks. It supports parallel …

A network consists of nodes and edges between those nodes. Figure 1.1 (a) depicts a
network with 6 nodes and 11 edges. Many relations in our daily life can be modeled as …

When designing and implementing highly efficient scientific applications for parallel
computers such as clusters of workstations, it is inevitable to consider and to optimize the …

The TCP is a popular transport protocol used in the present-day Internet. When packet
losses occur the TCP assumes that the packet losses are due to congestion, and responds …

This paper defines algorithm engineering as a general methodology for algorithmic
research. The main process in this methodology is a cycle consisting of algorithm design …

Computing the reachability between two vertices in a graph is a fundamental problem in
graph data analysis. Most of the existing works assume that the edges in the graph have no …