Balanced graph partitioning
DOI10.1007/S00224-006-1350-7zbMATH Open1113.68069OpenAlexW2022490362MaRDI QIDQ863200FDOQ863200
Authors: Konstantin Andreev, Harald Räcke 
Publication date: 25 January 2007
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-006-1350-7
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (48)
- Sparse balanced partitions and the complexity of subgraph problems
- A heuristic method for solving the problem of partitioning graphs with supply and demand
- Partitioning a graph into small pieces with applications to path transversal
- Continuum limit of total variation on point clouds
- Competitive clustering of stochastic communication patterns on a ring
- Balanced connected graph partition
- Title not available (Why is that?)
- A Polylogarithmic Approximation of the Minimum Bisection
- LOCALLY-BALANCED $k$-PARTITIONS OF GRAPHS
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- Balanced allocation on hypergraphs
- Scalable parallel implementation of CISAMR: a non-iterative mesh generation algorithm
- Improved analysis of online balanced clustering
- Distributed balanced partitioning via linear embedding
- Partitioning of supply/demand graphs with capacity limitations: an ant colony approach
- Continuous graph partitioning for camera network surveillance
- Multiply balanced \(k\)-partitioning
- Structural and algorithmic properties of 2-community structures
- Unbalanced graph partitioning
- Optimized quantum circuit partitioning
- Composing dynamic programming tree-decomposition-based algorithms
- New insight into 2-community structures in graphs with applications in social networks
- A dynamic programming approach for distributing quantum circuits by bipartite graphs
- Balanced partitions of trees and applications
- A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs
- Correlation clustering with constrained cluster sizes and extended weights bounds
- Time optimal consensus tracking with multiple leaders
- On minimum bisection and related partition problems in graphs with bounded tree width
- Approximating minimum \(k\)-section in trees with linear diameter
- Employee workload balancing by graph partitioning
- Nonuniform graph partitioning with unrelated weights
- Non-uniform graph partitioning
- Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking
- Partitioning graphs into balanced components
- Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization
- On the parameterized complexity of computing balanced partitions in graphs
- Improved approximation algorithms for balanced partitioning problems
- Unbalanced graph partitioning
- Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem
- Dynamic balanced graph partitioning
- Beyond good partition shapes: an analysis of diffusive graph partitioning
- Generating all patterns of graph partitions within a disparity bound
- Fast balanced partitioning is hard even on grids and trees
- Fast balanced partitioning is hard even on grids and trees
- Balanced tree partition problems with virtual nodes
- Approximation algorithm for sparsest \(k\)-partitioning
- Balanced partitions of trees and applications
- Optimization of the transmission cost of distributed quantum circuits based on merged transfer
This page was built for publication: Balanced graph partitioning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q863200)
