Finding a small vertex cut on distributed networks (Q6499342): Difference between revisions

@@ Property / cites work @@
+A probabilistic algorithm for vertex connectivity of graphs
+Normal rank
@@ Property / cites work @@
+Distributed connectivity decomposition
@@ Property / cites work: Distributed connectivity decomposition / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed Triangle Detection via Expander Decomposition
+Normal rank
@@ Property / cites work @@
+Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration
+Normal rank
@@ Property / cites work @@
+Q4228452
@@ Property / cites work: Q4228452 / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed edge connectivity in sublinear time
@@ Property / cites work: Distributed edge connectivity in sublinear time / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed Verification and Hardness of Distributed Approximation
+Normal rank
@@ Property / cites work @@
+Distributed Approximation of Minimum k-edge-connected Spanning Subgraphs
+Normal rank
@@ Property / cites work @@
+Distributed weighted min-cut in nearly-optimal time
+Normal rank
@@ Property / cites work @@
+Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph
+Normal rank
@@ Property / cites work @@
+A faster distributed protocol for constructing a minimum spanning tree
+Normal rank
@@ Property / cites work @@
+Distributed exact shortest paths in sublinear time
+Normal rank
@@ Property / cites work @@
+An Algorithm for Determining Whether the Connectivity of a Graph is at Least<i>k</i>
+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 @@
+Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms
+Normal rank
@@ Property / cites work @@
+Using expander graphs to find vertex connectivity
@@ Property / cites work: Using expander graphs to find vertex connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
+Normal rank
@@ Property / cites work @@
+Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search
+Normal rank
@@ Property / cites work @@
+Voronoi Diagrams on Planar Graphs, and Computing the Diameter in Deterministic $\tilde{O}(n^{5/3})$ Time
+Normal rank
@@ Property / cites work @@
+Testing 2-Vertex Connectivity and Computing Pairs of Vertex-Disjoint s-t Paths in Digraphs
+Normal rank
@@ Property / cites work @@
+Near-Optimal Scheduling of Distributed Algorithms
@@ Property / cites work: Near-Optimal Scheduling of Distributed Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Near-Optimal Distributed Maximum Flow
@@ Property / cites work: Near-Optimal Distributed Maximum Flow / rank @@
+Normal rank
@@ Property / cites work @@
+Near-Optimal Distributed Maximum Flow
@@ Property / cites work: Near-Optimal Distributed Maximum Flow / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed Minimum Cut Approximation
@@ Property / cites work: Distributed Minimum Cut Approximation / rank @@
+Normal rank
@@ Property / cites work @@
+Improved distributed algorithms for exact shortest paths
+Normal rank
@@ Property / cites work @@
+Faster Algorithms for Edge Connectivity via Random 2-Out Contractions
+Normal rank
@@ Property / cites work @@
+Universally-optimal distributed algorithms for known topologies
+Normal rank
@@ Property / cites work @@
+Efficient randomized distributed coloring in CONGEST
+Normal rank
@@ Property / cites work @@
+A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
+Normal rank
@@ Property / cites work @@
+Local Flow Partitioning for Faster Edge Connectivity
+Normal rank
@@ Property / cites work @@
+Computing Vertex Connectivity: New Bounds from Old Techniques
+Normal rank
@@ Property / cites work @@
+Dividing a Graph into Triconnected Components
@@ Property / cites work: Dividing a Graph into Triconnected Components / rank @@
+Normal rank
@@ Property / cites work @@
+Improved algorithms for graph four-connectivity
@@ Property / cites work: Improved algorithms for graph four-connectivity / 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 @@
+Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time
+Normal rank
@@ Property / cites work @@
+Fast Distributed Construction of Smallk-Dominating Sets and Applications
+Normal rank
@@ Property / cites work @@
+On the cut dimension of a graph
@@ Property / cites work: On the cut dimension of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Fast routing table construction using small messages
+Normal rank
@@ Property / cites work @@
+Vertex connectivity in poly-logarithmic max-flows
@@ Property / cites work: Vertex connectivity in poly-logarithmic max-flows / rank @@
+Normal rank
@@ Property / cites work @@
+Rubber bands, convex embeddings and graph connectivity
+Normal rank
@@ Property / cites work @@
+Weighted min-cut: sequential, cut-query, and streaming algorithms
+Normal rank
@@ Property / cites work @@
+Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
+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 @@
+Distributed approximation algorithms for weighted shortest paths
+Normal rank
@@ Property / cites work @@
+Dynamic spanning forest with worst-case update time: adaptive, Las Vegas, and O(n<sup>1/2 - ε</sup>)-time
+Normal rank
@@ Property / cites work @@
+Breaking quadratic time for small vertex connectivity and an approximation scheme
+Normal rank
@@ Property / cites work @@
+Almost-Tight Distributed Minimum Cut Algorithms
@@ Property / cites work: Almost-Tight Distributed Minimum Cut Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Small cuts and connectivity certificates: a fault tolerant approach
+Normal rank
@@ Property / cites work @@
+A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction
+Normal rank
@@ Property / cites work @@
+Fast computation of small cuts via cycle space sampling
+Normal rank
@@ Property / cites work @@
+Q4993305
@@ Property / cites work: Q4993305 / rank @@
+Normal rank
@@ Property / cites work @@
+Expander Decomposition and Pruning: Faster, Stronger, and Simpler
+Normal rank
@@ Property / cites work @@
+A Local Clustering Algorithm for Massive Graphs and Its Application to Nearly Linear Time Graph Partitioning
+Normal rank
@@ Property / cites work @@
+Depth-First Search and Linear Graph Algorithms
@@ Property / cites work: Depth-First Search and Linear Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Sub-linear Distributed Algorithms for Sparse Certificates and Biconnected Components
+Normal rank
@@ Property / cites work @@
+Fully-dynamic minimum spanning forest with improved worst-case update time
+Normal rank