Balanced graph partitioning
From MaRDI portal
Publication:863200
DOI10.1007/s00224-006-1350-7zbMath1113.68069OpenAlexW2022490362MaRDI QIDQ863200
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
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) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (35)
Balanced connected graph partition ⋮ Structural and algorithmic properties of 2-community structures ⋮ On minimum bisection and related partition problems in graphs with bounded tree width ⋮ Approximating minimum \(k\)-section in trees with linear diameter ⋮ New Insight into 2-Community Structures in Graphs with Applications in Social Networks ⋮ Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking ⋮ Fast balanced partitioning is hard even on grids and trees ⋮ Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds ⋮ LOCALLY-BALANCED $k$-PARTITIONS OF GRAPHS ⋮ Beyond good partition shapes: an analysis of diffusive graph partitioning ⋮ Optimization of the transmission cost of distributed quantum circuits based on merged transfer ⋮ Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations ⋮ Balanced tree partition problems with virtual nodes ⋮ A dynamic programming approach for distributing quantum circuits by bipartite graphs ⋮ Partitioning of supply/demand graphs with capacity limitations: an ant colony approach ⋮ Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization ⋮ Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem ⋮ Generating All Patterns of Graph Partitions Within a Disparity Bound ⋮ Dynamic Balanced Graph Partitioning ⋮ Competitive clustering of stochastic communication patterns on a ring ⋮ On the parameterized complexity of computing balanced partitions in graphs ⋮ Parameterized complexity of asynchronous border minimization ⋮ Scalable parallel implementation of CISAMR: a non-iterative mesh generation algorithm ⋮ Distributed balanced partitioning via linear embedding ⋮ Optimized quantum circuit partitioning ⋮ The complexity of tree partitioning ⋮ Partitioning a graph into small pieces with applications to path transversal ⋮ Unnamed Item ⋮ Improved analysis of online balanced clustering ⋮ Continuous graph partitioning for camera network surveillance ⋮ Time optimal consensus tracking with multiple leaders ⋮ Balanced partitions of trees and applications ⋮ A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs ⋮ A heuristic method for solving the problem of partitioning graphs with supply and demand ⋮ Continuum limit of total variation on point clouds
This page was built for publication: Balanced graph partitioning
