Faster connectivity in low-rank hypergraphs via expander decomposition (Q2164680): Difference between revisions

@@ Property / cites work @@
+Q4607983
@@ Property / cites work: Q4607983 / rank @@
+Normal rank
@@ Property / cites work @@
+Computing minimum cuts in hypergraphs
@@ Property / cites work: Computing minimum cuts in hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum Cuts and Sparsification in Hypergraphs
@@ Property / cites work: Minimum Cuts and Sparsification in Hypergraphs / 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 @@
+Minimum Cut and Minimum <i>k</i>-Cut in Hypergraphs via Branching Contractions
+Normal rank
@@ Property / cites work @@
+Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search
+Normal rank
@@ Property / cites work @@
+Random Contractions and Sampling for Hypergraph and Hedge Connectivity
+Normal rank
@@ Property / cites work @@
+Faster Algorithms for Edge Connectivity via Random 2-Out Contractions
+Normal rank
@@ Property / cites work @@
+Local Flow Partitioning for Faster Edge Connectivity
+Normal rank
@@ Property / cites work @@
+Q3140397
@@ Property / cites work: Q3140397 / rank @@
+Normal rank
@@ Property / cites work @@
+A new approach to the minimum cut problem
@@ Property / cites work: A new approach to the minimum cut problem / 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 @@
+Deterministic Edge Connectivity in Near-Linear Time
+Normal rank
@@ Property / cites work @@
+Sketching Cuts in Graphs and Hypergraphs
@@ Property / cites work: Sketching Cuts in Graphs and Hypergraphs / rank @@
+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 @@
+A fast hypergraph min-cut algorithm for circuit partitioning
+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 @@
+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 @@
+Minimizing symmetric submodular functions
@@ Property / cites work: Minimizing symmetric submodular functions / rank @@
+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 @@
+Fully-dynamic minimum spanning forest with improved worst-case update time
+Normal rank