FULLY POLYNOMIAL-TIME APPROXIMATION SCHEMES FOR THE MAX–MIN CONNECTED PARTITION PROBLEM ON INTERVAL GRAPHS (Q2905305): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Max-min partitioning of grid graphs into connected components
+Normal rank
@@ Property / cites work @@
+Approximating the Maximally Balanced Connected Partition Problem in graphs
+Normal rank
@@ Property / cites work @@
+On the complexity of partitioning graphs into connected subgraphs
+Normal rank
@@ Property / cites work @@
+On the approximability of some Maximum Spanning Tree Problems
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / 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 @@
+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 @@
+A linear algorithm for bipartition of biconnected graphs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2905305