I/O efficient algorithms for the minimum cut problem on unweighted undirected graphs (Q2339449): 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.tcs.2014.10.043
+Normal rank
@@ Property / OpenAlex ID @@
+W2108852404
@@ Property / OpenAlex ID: W2108852404 / rank @@
+Normal rank
@@ Property / cites work @@
+A matroid approach to finding edge connectivity and packing arborescences
+Normal rank
@@ Property / cites work @@
+Fully-dynamic min-cut
@@ Property / cites work: Fully-dynamic min-cut / rank @@
+Normal rank
@@ Property / cites work @@
+A simple and fast min-cut algorithm
@@ Property / cites work: A simple and fast min-cut algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum cuts in near-linear time
@@ Property / cites work: Minimum cuts in near-linear time / rank @@
+Normal rank
@@ Property / cites work @@
+An $\NC$ Algorithm for Minimum Cuts
@@ Property / cites work: An $\NC$ Algorithm for Minimum Cuts / rank @@
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
+Normal rank
@@ Property / cites work @@
+A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
+Normal rank
@@ Property / cites work @@
+A simple min-cut algorithm
@@ Property / cites work: A simple min-cut algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+The maximum flow problem is log space complete for P
+Normal rank
@@ Property / cites work @@
+Q3140458
@@ Property / cites work: Q3140458 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886043
@@ Property / cites work: Q4886043 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4252349
@@ Property / cites work: Q4252349 / rank @@
+Normal rank
@@ Property / cites work @@
+Edge-Disjoint Spanning Trees of Finite Graphs
@@ Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Fractional Packing and Covering Problems
+Normal rank
@@ Property / cites work @@
+Q2721962
@@ Property / cites work: Q2721962 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4886046
@@ Property / cites work: Q4886046 / rank @@
+Normal rank
@@ Property / cites work @@
+The buffer tree: A technique for designing batched external data structures
+Normal rank
@@ Property / cites work @@
+External Memory Soft Heap, and Hard Heap, a Meldable Priority Queue
+Normal rank