Balanced graph partitioning
From MaRDI portal
Recommendations
Cited in
(48)- Employee workload balancing by graph partitioning
- Structural and algorithmic properties of 2-community structures
- Dynamic balanced graph partitioning
- On the parameterized complexity of computing balanced partitions in graphs
- A dynamic programming approach for distributing quantum circuits by bipartite graphs
- Distributed balanced partitioning via linear embedding
- Balanced connected graph partition
- Balanced tree partition problems with virtual nodes
- 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
- scientific article; zbMATH DE number 7310218 (Why is no real title available?)
- Continuous graph partitioning for camera network surveillance
- Composing dynamic programming tree-decomposition-based algorithms
- Approximation algorithm for sparsest \(k\)-partitioning
- Generating all patterns of graph partitions within a disparity bound
- A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs
- Nonuniform graph partitioning with unrelated weights
- Balanced partitions of trees and applications
- Balanced partitions of trees and applications
- Unbalanced graph partitioning
- Optimized quantum circuit partitioning
- Unbalanced graph partitioning
- Sparse balanced partitions and the complexity of subgraph problems
- A Polylogarithmic Approximation of the Minimum Bisection
- Optimization of the transmission cost of distributed quantum circuits based on merged transfer
- Beyond good partition shapes: an analysis of diffusive graph partitioning
- Fast balanced partitioning is hard even on grids and trees
- Fast balanced partitioning is hard even on grids and trees
- A heuristic method for solving the problem of partitioning graphs with supply and demand
- Correlation clustering with constrained cluster sizes and extended weights bounds
- LOCALLY-BALANCED $k$-PARTITIONS OF GRAPHS
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations
- 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
- Balanced allocation on hypergraphs
- Multiply balanced \(k\)-partitioning
- Partitioning graphs into balanced components
- On minimum bisection and related partition problems in graphs with bounded tree width
- Improved analysis of online balanced clustering
- Approximating minimum \(k\)-section in trees with linear diameter
- Continuum limit of total variation on point clouds
- Competitive clustering of stochastic communication patterns on a ring
- Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem
- Time optimal consensus tracking with multiple leaders
- Partitioning a graph into small pieces with applications to path transversal
- Improved approximation algorithms for balanced partitioning problems
- Scalable parallel implementation of CISAMR: a non-iterative mesh generation algorithm
- Non-uniform graph partitioning
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)
