Fast Approximate Graph Partitioning Algorithms
From MaRDI portal
Linear programming (90C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Applications of graph theory to circuits and networks (94C15) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)
Recommendations
Cited in
(32)- Partitioning a graph into small pieces with applications to path transversal
- Efficient partitioning algorithms for optimizing big graph computation
- Coloring Graphs with Minimal Edge Load
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Balanced graph partitioning
- A faster algorithm for computing the principal sequence of partitions of a graph
- Inoculation strategies for victims of viruses and the sum-of-squares partition problem
- Approximation algorithms for treewidth, pathwidth, and treedepth -- a short survey
- Approximation algorithms for general packing problems and their application to the multicast congestion problem
- A general variable neighborhood search approach for the minimum load coloring problem
- Finding small balanced separators
- EFFICIENT APPROXIMATION ALGORITHMS FOR PAIRWISE DATA CLUSTERING AND APPLICATIONS
- On treewidth, separators and Yao's garbling
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint
- \(\ell ^2_2\) spreading metrics for vertex ordering problems
- Graph bisection with Pareto-optimization
- scientific article; zbMATH DE number 1942408 (Why is no real title available?)
- On the advantage of overlapping clusters for minimizing conductance
- Approximating small balanced vertex separators in almost linear time
- Approximating small balanced vertex separators in almost linear time
- Graph partitioning using single commodity flows
- Divide-and-conquer approximation algorithms via spreading metrics
- Partitioning graphs into balanced components
- On treewidth approximations.
- Improved approximation algorithms for balanced partitioning problems
- Graph partitioning using single commodity flows
- The application of cluster analysis in geophysical data interpretation
- Dynamic balanced graph partitioning
- Fission: Practical algorithms for computing minimum balanced node separators
- Graph bisection with Pareto optimization
- Fast balanced partitioning is hard even on grids and trees
- Balanced partitions of trees and applications
This page was built for publication: Fast Approximate Graph Partitioning Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268865)
