Algorithm 1003: Mongoose, a graph coarsening and partitioning library

DOI10.1145/3337792MaRDI QIDQ5132310zbMATH OpenOpenAlexWikidataFDO

Authors Timothy A. Davis, William Hager, Scott Kolodziej, Sencer Yeralan

Publication date 10 November 2020

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3337792

zbMATH Keywords

graph coarseninggraph partitioningvertex matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Advanced coarsening schemes for graph partitioning
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
• scientific article; zbMATH DE number 2131658
• \(n\)-level graph partitioning
• Engineering multilevel graph partitioning algorithms

Cited in

(4)

• Mongoose
• Jet: multilevel graph partitioning on graphics processing units
• Sparse linear least-squares problems
• Linear-time multilevel graph partitioning via edge sparsification

Describes a project that uses

Uses Software

• SparseMatrix
• Zoltan
• Scotch
• METIS
• ParMETIS
• PARTY
• Chaco
• WebGraph

This page was built for publication: Algorithm 1003: Mongoose, a graph coarsening and partitioning library

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5132310)