The following pages link to Balanced graph partitioning (Q863200):
Displaying 29 items.
- A heuristic method for solving the problem of partitioning graphs with supply and demand (Q256649) (← links)
- Continuum limit of total variation on point clouds (Q261295) (← links)
- On minimum bisection and related partition problems in graphs with bounded tree width (Q322301) (← links)
- Approximating minimum \(k\)-section in trees with linear diameter (Q324723) (← links)
- Fast balanced partitioning is hard even on grids and trees (Q388790) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- Balanced connected graph partition (Q831759) (← links)
- Structural and algorithmic properties of 2-community structures (Q1635716) (← links)
- Partitioning of supply/demand graphs with capacity limitations: an ant colony approach (Q1698074) (← links)
- Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem (Q1705774) (← links)
- Parameterized complexity of asynchronous border minimization (Q1755787) (← links)
- Beyond good partition shapes: an analysis of diffusive graph partitioning (Q1934315) (← links)
- Scalable parallel implementation of CISAMR: a non-iterative mesh generation algorithm (Q1999563) (← links)
- Distributed balanced partitioning via linear embedding (Q2005567) (← links)
- Optimized quantum circuit partitioning (Q2024874) (← links)
- Improved analysis of online balanced clustering (Q2085752) (← links)
- Impact of minimum-cut density-balanced partitioning solutions in distributed webpage ranking (Q2174897) (← links)
- Competitive clustering of stochastic communication patterns on a ring (Q2218479) (← links)
- Partitioning a graph into small pieces with applications to path transversal (Q2316611) (← links)
- Continuous graph partitioning for camera network surveillance (Q2342775) (← links)
- Balanced partitions of trees and applications (Q2346962) (← links)
- A new self-stabilizing algorithm for maximal \(p\)-star decomposition of general graphs (Q2353636) (← links)
- Balanced tree partition problems with virtual nodes (Q2424724) (← links)
- A dynamic programming approach for distributing quantum circuits by bipartite graphs (Q2684320) (← links)
- Connectivity matrix model of quantum circuits and its application to distributed quantum circuit optimization (Q2690531) (← links)
- Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds (Q2947231) (← links)
- Generating All Patterns of Graph Partitions Within a Disparity Bound (Q2980904) (← links)
- Optimization of the transmission cost of distributed quantum circuits based on merged transfer (Q6101574) (← links)
- Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
