
MESHPART
 Referenced in 55 articles
[sw04178]
 routines to generate recursive multiway partitions, vertex separators, and nested dissection orderings ... interface to Leland and Hendrickson’s Chaco partitioning package, but it doesn’t contain Chaco...

Algorithm 447
 Referenced in 137 articles
[sw12877]
 components and simple paths. The algorithm for partitioning of a graph into simple paths ... vertices already on paths. (The start vertex can be specified dynamically...

KaHIP
 Referenced in 10 articles
[sw19376]
 Buffoon), to output a vertex separator from a given partition or techniques geared towards efficient...

DibaP
 Referenced in 14 articles
[sw08343]
 graph partitions. Graph partitioning requires the division of a graph’s vertex set into ... some objective function is optimized. Highquality partitions are important for many applications, whose objective...

GraphSET
 Referenced in 1 article
[sw09795]
 colored simultaneous embedding with the vertex set partitioned into color classes. The tool...

BubbleFOS/C
 Referenced in 8 articles
[sw06814]
 good experimental results in terms of graph partitioning metrics. Moreover, we show that in bisections ... random walks, we prove that in vertextransitive graphs both parts must be connected components...

SAcluster
 Referenced in 8 articles
[sw06867]
 partition vertices in a large graph into clusters based on various criteria such as vertex...

3D triangulations
 Referenced in 8 articles
[sw11148]
 frontier, the triangulation forms a partition of R3. Its cells ( 3faces) are such that ... facet ( 2face), edge ( 1face) or vertex ( 0face...

Inccluster
 Referenced in 4 articles
[sw06866]
 partition vertices in a large graph into clusters based on various criteria such as vertex...

FOS/C
 Referenced in 3 articles
[sw06840]
 good experimental results in terms of graph partitioning metrics. Moreover, we show that in bisections ... random walks, we prove that in vertextransitive graphs both parts must be connected components...

KaHyPar
 Referenced in 4 articles
[sw20718]
 search method is used to improve the partition induced by the coarser level. KaHyPar instantiates ... most extreme version, removing only a single vertex in every level of the hierarchy...

Giraphx
 Referenced in 1 article
[sw07621]
 worker’s memory for the internal vertex executions. To ensure serializability, coordination is performedimplemented ... token ring  only for border vertices partitioned across workers. We implement our modifications...

ADOLC
 Referenced in 233 articles
[sw00019]
 ADOLC: Automatic Differentiation of C/C++. We present...

Apron
 Referenced in 67 articles
[sw00045]
 Apron: a library of numerical abstract domains for...

ARMS
 Referenced in 63 articles
[sw00048]
 ARMS: an algebraic recursive multilevel solver for general...

BoomerAMG
 Referenced in 158 articles
[sw00086]
 BoomerAMG: A parallel algebraic multigrid solver and preconditioner...

cdd
 Referenced in 110 articles
[sw00114]
 The program cdd+ (cdd, respectively) is a C...

CGAL
 Referenced in 354 articles
[sw00118]
 The goal of the CGAL Open Source Project...

CoCoA
 Referenced in 621 articles
[sw00143]
 CoCoA is a system for Computations in Commutative...