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 …

Current systems for graph computation require a distributed computing cluster to handle
very large real-world problems, such as analysis on social networks or the web graph. While …

Recently, several external memory techniques have been developed for a wide variety of
graphics and visualization problems, including surface simplification, volume rendering …

This survey reviews the research related to PageRank computing. Components of a
PageRank vector serve as authority weights for web pages independent of their textual …

Computational Geometry is an area that provides solutions to geometric problems which
arise in applications including Geographic Information Systems, Robotics and Computer …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

Although there are many advanced and specialized texts and handbooks on algorithms,
until now there was no book that focused exclusively on the wide variety of data structures …

Algorithms for Graph Partitioning: A Survey Page 1 Link o** Electronic Articles in Computer
and Information Science Vol. 3(1998): nr 10 Link o** University Electronic Press Link o** …

The suffix tree of a string is the fundamental data structure of combinatorial pattern matching.
We present a recursive technique for building suffix trees that yields optimal algorithms in …

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 …