Ordered Vertex Partitioning

Permuting Sparse Square Matrices into Block Diagonal Form with Overlap

In this whitepaper, we describe the problem of permuting sparse square matrices into block diagonal form with overlap (BDO) and propose a graph partitioning algorithm for solving this problem. A block diagonal matrix with overlap is a block diagonal matrix whose consecutive diagonal blocks may overlap. The objective in this permutation problem is to minimize the total overlap size, whereas the ...

oGPVS/BDO: A Software Package for Ordered Graph Partitioning by Vertex Separators and Permuting Matrices into Block Diagonal Form with Overlap

A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap

We investigate the problem of symmetrically permuting a square sparse matrix into a block diagonal form with overlap. This permutation problem arises in the parallelization of an explicit formulation of the multiplicative Schwarz preconditioner and a more recent block overlapping banded linear solver as well as its application to general sparse linear systems. In order to formulate this permuta...

Ordered and linked chordal graphs

A graph G is called k-ordered if for every sequence of k distinct vertices there is a cycle traversing these vertices in the given order. In the present paper we consider two novel generalizations of this concept, k-vertex-edge-ordered and strongly k-vertex-edge-ordered . We prove the following results for a chordal graph G: (a) G is (2k − 3)-connected if and only if it is k-vertex-edge-ordered...

Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs

The modeling flexibility provided by hypergraphs has drawn a lot of interest from the combinatorial scientific community, leading to novel models and algorithms, their applications, and development of associated tools. Hypergraphs are now a standard tool in combinatorial scientific computing. The modeling flexibility of hypergraphs however, comes at a cost: algorithms on hypergraphs are inheren...

Computational techniques for vertex partitioning of graphs

A powerful vertex-partitioning algorithm is developed and applied for vertex partitioning of graphs of chemical and spectroscopic interest. The codes developed on the basis of these algorithms are tested and compared for performance with other methods based on the Morgan algorithm and the principal eigenvector algorithm based on the Givens-Householder method. The newly developed algorithm and c...