Aggregative coarsening for multilevel hypergraph partitioning
From MaRDI portal
Recommendations
- Relaxation-based coarsening for multilevel hypergraph partitioning
- Advanced coarsening schemes for graph partitioning
- Parallel multilevel algorithms for hypergraph partitioning
- k-way hypergraph partitioning via n-level recursive bisection
- Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
Cites work
- k-way hypergraph partitioning via n-level recursive bisection
- \textit{BoomerAMG}: A parallel algebraic multigrid solver and preconditioner
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
- A Multilevel Algorithm for the Minimum 2-sum Problem
- A multilevel algorithm for wavefront reduction
- A Multilevel Approach to the Travelling Salesman Problem
- Advanced coarsening schemes for graph partitioning
- Algebraic distance on graphs
- An Efficient Heuristic Procedure for Partitioning Graphs
- An overview of the Trilinos project
- College Admissions and the Stability of Marriage
- Engineering a direct \(k\)-way hypergraph partitioning algorithm
- Fast unfolding of communities in large networks
- Graph minimum linear arrangement by multilevel weighted edge contractions
- High Performance Computing - HiPC 2003
- scientific article; zbMATH DE number 45086 (Why is no real title available?)
- scientific article; zbMATH DE number 2068044 (Why is no real title available?)
- Lean algebraic multigrid (LAMG): fast graph Laplacian linear solver
- Local search approaches in stable matching problems
- Multilevel algorithms for linear ordering problems
- Multilevel local search algorithms for modularity clustering
- Multilevel refinement for combinatorial optimisation problems
- Multiscale approach for the network compression-friendly ordering
- New challenges in dynamic load balancing
- Overlays with preferences: distributed, adaptive approximation algorithms for matching with preference lists
- Recent directions in netlist partitioning: a survey
- Relaxation-based coarsening and multiscale graph organization
- The University of Florida sparse matrix collection
Cited in
(5)- A multi-level hypergraph partitioning algorithm using rough set clustering
- Advanced coarsening schemes for graph partitioning
- Improving coarsening schemes for hypergraph partitioning by exploiting community structure
- Network Flow-Based Refinement for Multilevel Hypergraph Partitioning
- Relaxation-based coarsening for multilevel hypergraph partitioning
This page was built for publication: Aggregative coarsening for multilevel hypergraph partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5140706)
