Partitioning a graph into balanced connected classes: formulations, separation and experiments (Q2030323): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2020.12.059
+Normal rank
@@ Property / OpenAlex ID @@
+W3118973667
@@ Property / OpenAlex ID: W3118973667 / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced Partition of Minimum Spanning Trees
@@ Property / cites work: Balanced Partition of Minimum Spanning Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Max-min partitioning of grid graphs into connected components
+Normal rank
@@ Property / cites work @@
+Shifting algorithms for tree partitioning with general weighting functions
+Normal rank
@@ Property / cites work @@
+A Shifting Algorithm for Min-Max Tree Partitioning
+Normal rank
@@ Property / cites work @@
+Approximating the Maximally Balanced Connected Partition Problem in graphs
+Normal rank
@@ Property / cites work @@
+The \(\gamma\)-connected assignment problem
@@ Property / cites work: The \(\gamma\)-connected assignment problem / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of partitioning graphs into connected subgraphs
+Normal rank
@@ Property / cites work @@
+Q3138951
@@ Property / cites work: Q3138951 / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to the maximum-flow problem
@@ Property / cites work: A new approach to the maximum-flow problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q4168622
@@ Property / cites work: Q4168622 / rank @@
+Normal rank
@@ Property / cites work @@
+The disjoint paths problem in quadratic time
@@ Property / cites work: The disjoint paths problem in quadratic time / rank @@
+Normal rank
@@ Property / cites work @@
+A homology theory for spanning tress of a graph
@@ Property / cites work: A homology theory for spanning tress of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Most uniform path partitioning and its use in image processing
+Normal rank
@@ Property / cites work @@
+An \(O(k^ 2 n^ 2)\) algorithm to find a \(k\)-partition in a \(k\)- connected graph
+Normal rank
@@ Property / cites work @@
+Clustering on trees
@@ Property / cites work: Clustering on trees / rank @@
+Normal rank
@@ Property / cites work @@
+A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem
+Normal rank
@@ Property / cites work @@
+Cut and flow formulations for the balanced connected \(k\)-partition problem
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for four-partitioning four-connected planar graphs
+Normal rank
@@ Property / cites work @@
+Max-Min Tree Partitioning
@@ Property / cites work: Max-Min Tree Partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+Doubly Balanced Connected Graph Partitioning
@@ Property / cites work: Doubly Balanced Connected Graph Partitioning / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228482
@@ Property / cites work: Q4228482 / rank @@
+Normal rank
@@ Property / cites work @@
+FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS
+Normal rank