Abusing a hypergraph partitioner for unweighted graph partitioning

MaRDI QIDQ5298930zbMATH OpenFDO

Authors B. O. Fagginger Auer, R. H. Bisseling

Publication date 25 June 2013

zbMATH Keywords

Mondriaan matrix partitionerunweighted graph partitioning

Mathematics Subject Classification ID

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

Recommendations

• Parallel partitioning with Zoltan: is hypergraph partitioning worth it?
• scientific article; zbMATH DE number 2131658
• scientific article; zbMATH DE number 910878
• \(n\)-level graph partitioning
• A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

Cited in

(4)

• Efficient matching for column intersection graphs
• Minimum nonuniform graph partitioning with unrelated weights
• Parallel partitioning with Zoltan: is hypergraph partitioning worth it?
• Graph-Based Representations in Pattern Recognition

Describes a project that uses

Uses Software

• PaToH

This page was built for publication: Abusing a hypergraph partitioner for unweighted graph partitioning

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