Advanced Coarsening Schemes for Graph Partitioning
From MaRDI portal
Publication:2828188
DOI10.1145/2670338zbMath1347.68355OpenAlexW1490949485MaRDI QIDQ2828188
Christian Schulz, Ilya Safro, Peter Sanders
Publication date: 24 October 2016
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2670338
Analysis of algorithms (68W40) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Nonnumerical algorithms (68W05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12)
Related Items
Leveraging special-purpose hardware for local search heuristics, State-defect constraint pairing graph coarsening method for Karush-Kuhn-Tucker matrices arising in orthogonal collocation methods for optimal control, Unnamed Item, Local search for constrained graph clustering in biological networks, Perfect reconstruction two-channel filter banks on arbitrary graphs, ELRUNA, A reactive self-tuning scheme for multilevel graph partitioning, Total Variation Based Community Detection Using a Nonlinear Optimization Approach, Approximating Spectral Clustering via Sampling: A Review, A multilevel bilinear programming algorithm for the vertex separator problem, Relaxation-Based Coarsening for Multilevel Hypergraph Partitioning, Advanced Coarsening Schemes for Graph Partitioning, Multilevel graph partitioning for three-dimensional discrete fracture network flow simulations, Unnamed Item, Tree-Based Coarsening and Partitioning of Complex Networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multilevel refinement for combinatorial optimisation problems
- A simple approximation algorithm for the weighted matching problem
- Finding good approximate vertex and edge partitions is NP-hard
- A combined evolutionary search and multilevel optimisation approach to graph-partitioning
- An exact algorithm for graph partitioning
- Linear and quadratic programming approaches for the general graph partitioning problem
- A Multilevel Algorithm for Wavefront Reduction
- Advanced Coarsening Schemes for Graph Partitioning
- Relaxation-Based Coarsening and Multiscale Graph Organization
- An Experimental Evaluation of Multilevel Layout Methods
- Engineering Multilevel Graph Partitioning Algorithms
- Algebraic Distance on Graphs
- Partitioning Sparse Matrices with Eigenvectors of Graphs
- Genetic algorithm and graph partitioning
- Solving Graph Bisection Problems with Semidefinite Programming
- Graph Partitioning and Continuous Quadratic Programming
- Graph Partitioning and Graph Clustering
- Distributed Evolutionary Graph Partitioning
- Multilevel algorithms for linear ordering problems
- Engineering Algorithms for Approximate Weighted Matching
- Graph minimum linear arrangement by multilevel weighted edge contractions
