Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs

DOI10.1137/100810022zbMath1245.05104OpenAlexW1965758428MaRDI QIDQ2904820

Cevdet Aykanat, Ali Pınar, Enver Kayaaslan, Ü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

sparse matriceshypergraph partitioningcombinatorial scientific computinggraph partitioning by vertex separator

Mathematics Subject Classification ID

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

Related Items (8)

A branch-and-price algorithm for capacitated hypergraph vertex separation ⋮ Hypergraph Cuts with General Splitting Functions ⋮ The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning ⋮ The Effect of Various Sparsity Structures on Parallelism and Algorithms to Reveal Those Structures ⋮ A multilevel bilinear programming algorithm for the vertex separator problem ⋮ A hybrid breakout local search and reinforcement learning approach to the vertex separator problem ⋮ A survey of direct methods for sparse linear systems ⋮ Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph

Uses Software

• METIS
• SparseMatrix
• PaToH
• hMETIS
• Parkway

This page was built for publication: Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs