An algorithm for improving graph partitions

zbMATH Open1192.68868MaRDI QIDQ3579376FDOQ3579376

Authors: Reid Andersen, Kevin J. Lang 

Publication date: 6 August 2010

Recommendations

• Integer Programming and Combinatorial Optimization
• Flow-based algorithms for local graph clustering
• Engineering multilevel graph partitioning algorithms
• scientific article; zbMATH DE number 910878
• Isoperimetric Partitioning: A New Algorithm for Graph Partitioning

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cited In (17)

• Iterated multilevel simulated annealing for large-scale graph conductance minimization
• Algorithm Engineering for Optimal Graph Bipartization
• Integer Programming and Combinatorial Optimization
• Variational perspective on local graph clustering
• An algorithm to maximize the agreement between partitions
• Comparison of algorithms in graph partitioning
• Title not available (Why is that?)
• Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
• Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem
• Experimental and Efficient Algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• An overlapping domain decomposition method for large-scale problems
• Title not available (Why is that?)
• Hypergraph Cuts with General Splitting Functions
• Title not available (Why is that?)
• Compressive sensing for cut improvement and local clustering

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)