
METIS
 Referenced in 404 articles
[sw04089]
 serial programs for partitioning graphs, partitioning finite element meshes, and producing fill reducing orderings...

Chaco
 Referenced in 110 articles
[sw09640]
 Chaco: Software for Partitioning Graphs. Before a calculation can be performed on a parallel computer ... addressed in terms of graph partitioning. Rob Leland and I have developed a variety ... algorithms for graph partitioning and implemented them into a package we call Chaco. The code...

Algorithm 447
 Referenced in 110 articles
[sw12877]
 manipulation. Efficient algorithms are presented for partitioning a graph into connected components, biconnected components ... simple paths. The algorithm for partitioning of a graph into simple paths of iterative...

ParMETIS
 Referenced in 90 articles
[sw04697]
 implements a variety of algorithms for partitioning unstructured graphs, meshes, and for computing fillreducing ... parallel multilevel kway graphpartitioning, adaptive repartitioning, and parallel multiconstrained partitioning schemes developed...

Zoltan
 Referenced in 42 articles
[sw07458]
 Zoltan: is hypergraph partitioning worth it? Graph partitioning is an important and well studied problem ... models (graph, hypergraph) and objectives (edge cut, boundary vertices) have been proposed. Hypergraph partitioning ... slower to compute than graph partitioning. par We present an empirical study of the Zoltan ... that hypergraph partitioning is superior to graph partitioning on directed graphs (nonsymmetric matrices), where...

JOSTLE
 Referenced in 32 articles
[sw04985]
 JOSTLE graph partitioning software. JOSTLE is a software package designed to partition unstructed meshes ... used to repartition and loadbalance existing partitions (such as those deriving from adaptive refined ... modelling the mesh as an undirected graph ... then using stateoftheart graph partitioning techniques. The code is extremely fast...

MESHPART
 Referenced in 54 articles
[sw04178]
 contains Matlab code for several graph and mesh partitioning methods, including geometric, spectral, geometric spectral...

DibaP
 Referenced in 14 articles
[sw08343]
 diffusionbased multilevel algorithm for computing graph partitions. Graph partitioning requires the division ... optimize. Most stateoftheart graph partitioning libraries use a variant of the Kernighan ... construction methods, we obtain our new graph partitioning heuristic DibaP. Compared to Bubble ... significant number of partitionings of six widely used benchmark graphs...

Localizer
 Referenced in 19 articles
[sw21238]
 results on Boolean satisfiability graph coloring, graph partitioning, and jobshop scheduling show the feasibility...

ParFUM
 Referenced in 14 articles
[sw08855]
 mesh using, for example, the Metis graph partitioning library...

BubbleFOS/C
 Referenced in 8 articles
[sw06814]
 partition shapes: an analysis of diffusive graph partitioning. ... We then regard BubbleFOS/C, which ... previous experiments to produce solutions with good partition shapes and other favorable properties. In this ... good experimental results in terms of graph partitioning metrics. Moreover, we show that in bisections ... walks, we prove that in vertextransitive graphs both parts must be connected components...

KaHIP
 Referenced in 7 articles
[sw19376]
 Quality Partitioning  is a family of graph partitioning programs. It includes KaFFPa (Karlsruhe Fast Flow ... Partitioner), which is a multilevel graph partitioning algorithm, in its variants Strong, Eco and Fast...

Parkway
 Referenced in 7 articles
[sw12863]
 tool and provides a runtime and partition quality comparison with state ... Kumar and Karypis’ parallel multilevel graph partitioning algorithm. This good theoretical scalability is backed...

PARTY
 Referenced in 9 articles
[sw20518]
 PARTY: The problem of partitioning a graph into a number of pieces ... like parallel programming or VLSI design.Finding optimal partitions according to different measures is in most...

FOS/C
 Referenced in 3 articles
[sw06840]
 partition shapes: an analysis of diffusive graph partitioning In this paper we study the prevalent ... problem of graph partitioning by analyzing the diffusionbased partitioning heuristic B{sc ubble}FOS/C ... component of a practical successful graph partitioner [{it H. Meyerhenke}, {it B. Monien ... good experimental results in terms of graph partitioning metrics. Moreover, we show that in bisections...

MC73
 Referenced in 5 articles
[sw12394]
 areas that include matrix reordering, graph partitioning, protein analysis, data mining, machine learning ... computing the Fiedler vector of large graphs based on the Trace Minimization algorithm. We compare...

CsegGraph
 Referenced in 7 articles
[sw00170]
 graph colouring instances are obtained as intersection graphs G Π (A) of the sparsity pattern ... with row partition Π. The size of the graph is dependent on the row partition ... block row partition Π=Π m ). The chromatic number of the generated graph instances satisfy...

SAcluster
 Referenced in 6 articles
[sw06867]
 large networks. The goal of graph clustering is to partition vertices in a large graph...

MENTA
 Referenced in 3 articles
[sw27334]
 heuristics to discover potential taxonomic relationships, graph partitioning to form consistent equivalence classes of entities...

TRACE
 Referenced in 2 articles
[sw06654]
 that combines 2 load balancing methodologies, graph partitioning and graph matching, to achieve maximum parallel...