Algorithms that nd good partitionings of unstructured and irregular graphs are critical for the
e cient execution of scienti c simulations on high performance parallel computers. In these …

Various randomized consensus algorithms have been proposed in the literature. In some
case randomness is due to the choice of a randomized network communication protocol. In …

This work presents a contribution to the solution of the average agreement problem on a
network with quantized links. Starting from the well‐known linear diffusion algorithm, we …

Multilevel algorithms are a successful class of optimization techniques which addresses the
mesh partitioning problem. They usually combine a graph contraction algorithm together …

Online social networks are a dominant medium in everyday life to stay in contact with friends
and to share information. In Twitter, users can connect with other users by following them …

In this paper, we shall give a survey of applications of the theory of graph spectra to
Computer Science. Eigenvalues and eigenvectors of several graph matrices appear in …

Three parallel optimisation algorithms, for use in the context of multilevel graph partitioning
of unstructured meshes, are described. The first, interface optimisation, reduces the …

For many applications, computation load varies over time. Such applications require
dynamic load balancing to improve performance. Centralized load balancing schemes …

We present a dynamic distributed load balancing algorithm for parallel, adaptive Finite
Element simulations in which we use preconditioned Conjugate Gradient solvers based on …

In this paper, we study an approximate projected consensus algorithm for a network to
cooperatively compute the intersection of convex sets, where each set corresponds to one …