An algorithm for improving graph partitions
From MaRDI portal
Recommendations
Cited in
(19)- An algorithm to maximize the agreement between partitions
- Variational perspective on local graph clustering
- An overlapping domain decomposition method for large-scale problems
- Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem
- scientific article; zbMATH DE number 1617249 (Why is no real title available?)
- scientific article; zbMATH DE number 5990414 (Why is no real title available?)
- Comparison of algorithms in graph partitioning
- Algorithm Engineering for Optimal Graph Bipartization
- scientific article; zbMATH DE number 1560342 (Why is no real title available?)
- Compressive sensing for cut improvement and local clustering
- Hypergraph Cuts with General Splitting Functions
- Statistical guarantees for local graph clustering
- Experimental and Efficient Algorithms
- Integer Programming and Combinatorial Optimization
- scientific article; zbMATH DE number 7651198 (Why is no real title available?)
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
- Iterated multilevel simulated annealing for large-scale graph conductance minimization
- Submodular hypergraph partitioning: metric relaxations and fast algorithms via an improved cut-matching game
- Sparsest cut and eigenvalue multiplicities on low degree abelian Cayley graphs
This page was built for publication: An algorithm for improving graph partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579376)
