A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms (Q1917270): Difference between revisions

@@ Property / describes a project that uses @@
+NETGEN
@@ Property / describes a project that uses: NETGEN / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
+Normal rank
@@ Property / cites work @@
+Efficient parallel algorithms for some graph problems
+Normal rank
@@ Property / cites work @@
+Parallel Merge Sort
@@ Property / cites work: Parallel Merge Sort / rank @@
+Normal rank
@@ Property / cites work @@
+Q4035360
@@ Property / cites work: Q4035360 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Multiterminal Cuts
@@ Property / cites work: The Complexity of Multiterminal Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+The solution of some random NP-hard problems in polynomial expected time
+Normal rank
@@ Property / cites work @@
+Network Flow and Testing Graph Connectivity
@@ Property / cites work: Network Flow and Testing Graph Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / 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 @@
+The maximum flow problem is log space complete for P
+Normal rank
@@ Property / cites work @@
+Q4763403
@@ Property / cites work: Q4763403 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023519
@@ Property / cites work: Q4023519 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3140397
@@ Property / cites work: Q3140397 / rank @@
+Normal rank
@@ Property / cites work @@
+An <i>Õ(n<sup>2</sup>)</i> algorithm for minimum cuts
+Normal rank
@@ Property / cites work @@
+Q4037409
@@ Property / cites work: Q4037409 / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Heuristic Procedure for Partitioning Graphs
+Normal rank
@@ Property / cites work @@
+Q4763402
@@ Property / cites work: Q4763402 / rank @@
+Normal rank
@@ Property / cites work @@
+NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
+Normal rank
@@ Property / cites work @@
+Q3997942
@@ Property / cites work: Q3997942 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
+Normal rank
@@ Property / cites work @@
+Selected Applications of Minimum Cuts in Networks
@@ Property / cites work: Selected Applications of Minimum Cuts in Networks / rank @@
+Normal rank
@@ Property / cites work @@
+Fast, Efficient Parallel Algorithms for Some Graph Problems
+Normal rank
@@ Property / cites work @@
+An O(logn) parallel connectivity algorithm
@@ Property / cites work: An O(logn) parallel connectivity algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+A data structure for dynamic trees
@@ Property / cites work: A data structure for dynamic trees / rank @@
+Normal rank
@@ Property / cites work @@
+Multiprocessor Scheduling with the Aid of Network Flow Algorithms
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0166-218x(95)00034-o
+Normal rank
@@ Property / OpenAlex ID @@
+W1967536438
@@ Property / OpenAlex ID: W1967536438 / rank @@
+Normal rank