Fast Approximate Graph Partitioning Algorithms
From MaRDI portal
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) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Linear programming (90C05) Applications of graph theory to circuits and networks (94C15)
Recommendations
Cited in
(34)- On treewidth approximations.
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint
- The application of cluster analysis in geophysical data interpretation
- Partitioning a graph into small pieces with applications to path transversal
- Balanced partitions of trees and applications
- Inoculation strategies for victims of viruses and the sum-of-squares partition problem
- On treewidth, separators and Yao's garbling
- Finding small balanced separators
- Divide-and-conquer approximation algorithms via spreading metrics
- Coloring Graphs with Minimal Edge Load
- Improved Approximation Algorithms for Minimum Weight Vertex Separators
- Fast balanced partitioning is hard even on grids and trees
- Finding Separator Cuts in Planar Graphs within Twice the Optimal
- scientific article; zbMATH DE number 1942408 (Why is no real title available?)
- Graph bisection with Pareto optimization
- Improved approximation algorithms for balanced partitioning problems
- Partitioning graphs into balanced components
- On the advantage of overlapping clusters for minimizing conductance
- EFFICIENT APPROXIMATION ALGORITHMS FOR PAIRWISE DATA CLUSTERING AND APPLICATIONS
- Dynamic balanced graph partitioning
- Graph bisection with Pareto-optimization
- Graph partitioning using single commodity flows
- Graph partitioning using single commodity flows
- Approximating small balanced vertex separators in almost linear time
- Approximating small balanced vertex separators in almost linear time
- A general variable neighborhood search approach for the minimum load coloring problem
- Fission: Practical algorithms for computing minimum balanced node separators
- Efficient partitioning algorithms for optimizing big graph computation
- Approximation algorithms for treewidth, pathwidth, and treedepth -- a short survey
- All-subsets important separators with applications to sample sets, balanced separators and vertex sparsifiers in directed graphs
- A faster algorithm for computing the principal sequence of partitions of a graph
- \(\ell ^2_2\) spreading metrics for vertex ordering problems
- Balanced graph partitioning
- Approximation algorithms for general packing problems and their application to the multicast congestion problem
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)
