Pages that link to "Item:Q4540070"
From MaRDI portal
The following pages link to Max-min partitioning of grid graphs into connected components (Q4540070):
Displayed 18 items.
- Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (Q385485) (← links)
- Max-min weight balanced connected partition (Q386475) (← links)
- Improved algorithms for path partition and related problems (Q408433) (← links)
- Path equipartition in the Chebyshev norm (Q1569949) (← links)
- Uniform and most uniform partitions of trees (Q1756346) (← links)
- On a 2-dimensional equipartition problem (Q1806658) (← links)
- Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323) (← links)
- Combinatorial approximation algorithms for the maximum bounded connected bipartition problem (Q2111532) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Approximation algorithms for the maximum bounded connected bipartition problem (Q2151359) (← links)
- Efficient geo-graph contiguity and hole algorithms for geographic zoning and dynamic plane graph partitioning (Q2515049) (← links)
- FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS (Q2905305) (← links)
- Balanced Connected Partitioning of Unweighted Grid Graphs (Q5005141) (← links)
- (Q5708519) (← links)
- Partitioning a matrix with non-guillotine cuts to minimize the maximum cost (Q5957361) (← links)
- Approximation and parameterized algorithms for balanced connected partition problems (Q6102278) (← links)
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds (Q6166191) (← links)
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)