Partitioning hypergraphs in scientific computing applications through vertex separators on graphs

DOI10.1137/100810022MaRDI QIDQ2904820zbMATH OpenOpenAlexFDO

Authors Enver Kayaaslan, Ali Pinar, Cevdet Aykanat, Ümit V. Çatalyürek

Publication date 23 August 2012

Published in SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11693/13160

zbMATH Keywords

combinatorial scientific computinggraph partitioning by vertex separatorhypergraph partitioningsparse matrices

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)

Recommendations

• scientific article; zbMATH DE number 2075198
• k-way hypergraph partitioning via n-level recursive bisection
• Parallel partitioning with Zoltan: is hypergraph partitioning worth it?
• A multi-level hypergraph partitioning algorithm using rough set clustering
• Relaxation-based coarsening for multilevel hypergraph partitioning

Cited in

(13)

• A hybrid breakout local search and reinforcement learning approach to the vertex separator problem
• A branch-and-price algorithm for capacitated hypergraph vertex separation
• Computing eigenvalues of large scale sparse tensors arising from a hypergraph
• The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures
• An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications
• The Fiedler vector of a Laplacian tensor for hypergraph partitioning
• Hypergraph Cuts with General Splitting Functions
• A survey of direct methods for sparse linear systems
• Generalized gains for hybrid vertex separator algorithms
• Minimum separator reconfiguration
• A multilevel bilinear programming algorithm for the vertex separator problem
• Minimum separator reconfiguration
• Scalable high-quality hypergraph partitioning

Describes a project that uses

Uses Software

• Parkway
• SparseMatrix
• hMETIS
• METIS
• PaToH

This page was built for publication: Partitioning hypergraphs in scientific computing applications through vertex separators on graphs

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