In recent years, significant advances have been made in the design and evaluation of
balanced (hyper) graph partitioning algorithms. We survey trends of the past decade in …

In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …

This book presents the fundamentals of sparse matrix algorithms, from theory to algorithms
and data structures to working code. The focus is on direct methods for solving systems of …

Graphs are often used to encapsulate the relationship between objects. Graph drawing
enables visualization of these relationships. The usefulness of the representation is …

Balanced graph partitioning in the streaming setting is a key problem to enable scalable and
efficient computations on massive graph data such as web graphs, knowledge graphs, and …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

Algorithms that find good partitionings of unstructured and irregular graphs are critical for the
efficient execution of scientific simulations on high performance parallel computers. This …

The Zoltan library is a collection of data management services for parallel, unstructured,
adaptive, and dynamic applications that is available as open-source software. It simplifies …

We address the new problem of protecting volunteer computing systems from malicious
volunteers who submit erroneous results by presenting sabotage-tolerance mechanisms …

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** …