The following pages link to (Q5387695):
Displayed 18 items.
- A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem (Q274945) (← links)
- 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)
- On the complexity of isoperimetric problems on trees (Q765346) (← links)
- Balanced connected graph partition (Q831759) (← links)
- Approximation algorithm for the balanced 2-connected \(k\)-partition problem (Q896161) (← links)
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint (Q1652415) (← links)
- Approximation algorithms for the maximally balanced connected graph tripartition problem (Q2082191) (← 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)
- Cardinality constrained connected balanced partitions of trees under different criteria (Q2684048) (← links)
- (Q3390778) (← links)
- (Q5881545) (← links)
- Approximation algorithms for maximally balanced connected graph partition (Q5918464) (← links)
- Reconfiguration of connected graph partitions via recombination (Q5925556) (← links)
- Approximation and parameterized algorithms for balanced connected partition problems (Q6102278) (← links)
- Balanced connected partitions of graphs: approximation, parameterization and lower bounds (Q6166191) (← links)