The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts (Q1803742): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Facets of the knapsack polytope
@@ Property / cites work: Facets of the knapsack polytope / rank @@
+Normal rank
@@ Property / cites work @@
+The Optimal Partitioning of Graphs
@@ Property / cites work: The Optimal Partitioning of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3753826
@@ Property / cites work: Q3753826 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3997942
@@ Property / cites work: Q3997942 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Solution to the Partitioning of General Graphs
+Normal rank
@@ Property / cites work @@
+A projection technique for partitioning the nodes of a graph
+Normal rank