Graph connectivity and its augmentation: Applications of MA orderings (Q697579): Difference between revisions

@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
+Normal rank
@@ Property / cites work @@
+Edge-Connectivity Augmentation with Partition Constraints
+Normal rank
@@ Property / cites work @@
+Edge-Connectivity Augmentation Preserving Simplicity
+Normal rank
@@ Property / cites work @@
+Augmenting undirected connectivity in RNC and in randomized Õ(<i>n</i><sup>3</sup>) time
+Normal rank
@@ Property / cites work @@
+The minimum augmentation of any graph to aK-edge-connected graph
+Normal rank
@@ Property / cites work @@
+Q5501810
@@ Property / cites work: Q5501810 / rank @@
+Normal rank
@@ Property / cites work @@
+Successive edge-connectivity augmentation problems
+Normal rank
@@ Property / cites work @@
+Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for <i>k</i>-Vertex Connectivity
+Normal rank
@@ Property / cites work @@
+Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
+Normal rank
@@ Property / cites work @@
+Q4371290
@@ Property / cites work: Q4371290 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4242949
@@ Property / cites work: Q4242949 / rank @@
+Normal rank
@@ Property / cites work @@
+Augmentation Problems
@@ Property / cites work: Augmentation Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4250191
@@ Property / cites work: Q4250191 / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting Graphs to Meet Edge-Connectivity Requirements
+Normal rank
@@ Property / cites work @@
+On sparse subgraphs preserving connectivity properties
+Normal rank
@@ Property / cites work @@
+Minimal edge-coverings of pairs of sets
@@ Property / cites work: Minimal edge-coverings of pairs of sets / rank @@
+Normal rank
@@ Property / cites work @@
+Directed vertex-connectivity augmentation
@@ Property / cites work: Directed vertex-connectivity augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+Fibonacci heaps and their uses in improved network optimization algorithms
+Normal rank
@@ Property / cites work @@
+ANOTHER SIMPLE PROOF OF THE VALIDITY OF NAGAMOCHI AND IBARAKI'S MIN-CUT ALGORITHM AND QUEYRANNE'S EXTENSION TO SYMMETRIC SUBMODULAR FUNCTION MINIMIZATION
+Normal rank
@@ Property / cites work @@
+Efficient splitting off algorithms for graphs
@@ Property / cites work: Efficient splitting off algorithms for graphs / rank @@
+Normal rank
@@ Property / cites work @@
+How to Make a Square Grid Framework with Cables Rigid
+Normal rank
@@ Property / cites work @@
+Optimal Mixed Graph Augmentation
@@ Property / cites work: Optimal Mixed Graph Augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
+Normal rank
@@ Property / cites work @@
+Computing Vertex Connectivity: New Bounds from Old Techniques
+Normal rank
@@ Property / cites work @@
+On Four-Connecting a Triconnected Graph
@@ Property / cites work: On Four-Connecting a Triconnected Graph / rank @@
+Normal rank
@@ Property / cites work @@
+A unifying augmentation algorithm for two-edge connectivity and biconnectivity
+Normal rank
@@ Property / cites work @@
+Finding a Smallest Augmentation to Biconnect a Graph
+Normal rank
@@ Property / cites work @@
+Q5595961
@@ Property / cites work: Q5595961 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2721988
@@ Property / cites work: Q2721988 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4370202
@@ Property / cites work: Q4370202 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4250193
@@ Property / cites work: Q4250193 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4249524
@@ Property / cites work: Q4249524 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4938784
@@ Property / cites work: Q4938784 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal augmentation of a 2-vertex-connected multigraph to an \(\ell\)-edge-connected and 3-vertex-connected multigraph
+Normal rank
@@ Property / cites work @@
+Multigraph augmentation under biconnectivity and general edge-connectivity requirements
+Normal rank
@@ Property / cites work @@
+Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
+Normal rank
@@ Property / cites work @@
+On the optimal vertex-connectivity augmentation
@@ Property / cites work: On the optimal vertex-connectivity augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the vertex-connectivity augmentation problem
+Normal rank
@@ Property / cites work @@
+Q4263718
@@ Property / cites work: Q4263718 / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting Outerplanar Graphs
@@ Property / cites work: Augmenting Outerplanar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4037427
@@ Property / cites work: Q4037427 / rank @@
+Normal rank
@@ Property / cites work @@
+Data Security Equals Graph Connectivity
@@ Property / cites work: Data Security Equals Graph Connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228454
@@ Property / cites work: Q4228454 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4542522
@@ Property / cites work: Q4542522 / 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 @@
+An <i>Õ(n<sup>2</sup>)</i> algorithm for minimum cuts
+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 @@
+Q3880849
@@ Property / cites work: Q3880849 / rank @@
+Normal rank
@@ Property / cites work @@
+A Reduction Method for Edge-Connectivity in Graphs
+Normal rank
@@ Property / cites work @@
+Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
+Normal rank
@@ Property / cites work @@
+Q3140458
@@ Property / cites work: Q3140458 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3840350
@@ Property / cites work: Q3840350 / rank @@
+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 @@
+Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
+Normal rank
@@ Property / cites work @@
+Deterministic \(\tilde O(nm)\) time edge-splitting in undirected graphs
+Normal rank
@@ Property / cites work @@
+A note on minimizing submodular functions
@@ Property / cites work: A note on minimizing submodular functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4249525
@@ Property / cites work: Q4249525 / rank @@
+Normal rank
@@ Property / cites work @@
+Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time
+Normal rank
@@ Property / cites work @@
+Polyhedral structure of submodular and posi-modular systems
+Normal rank
@@ Property / cites work @@
+Implementing an efficient minimum capacity cut algorithm
+Normal rank
@@ Property / cites work @@
+A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs
+Normal rank
@@ Property / cites work @@
+A fast algorithm for cactus representations of minimum cuts
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the minimum capacity cut problem
+Normal rank
@@ Property / cites work @@
+On the structure of all minimum cuts in a network and applications
+Normal rank
@@ Property / cites work @@
+Minimum block containing a given graph
@@ Property / cites work: Minimum block containing a given graph / rank @@
+Normal rank
@@ Property / cites work @@
+Minimizing symmetric submodular functions
@@ Property / cites work: Minimizing symmetric submodular functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q4398376
@@ Property / cites work: Q4398376 / rank @@
+Normal rank
@@ Property / cites work @@
+On minimizing symmetric set functions
@@ Property / cites work: On minimizing symmetric set functions / rank @@
+Normal rank
@@ Property / cites work @@
+A simple min-cut algorithm
@@ Property / cites work: A simple min-cut algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+Edge-connectivity augmentation problems
@@ Property / cites work: Edge-connectivity augmentation problems / rank @@
+Normal rank
@@ Property / cites work @@
+A minimum 3-connectivity augmentation of a graph
@@ Property / cites work: A minimum 3-connectivity augmentation of a graph / rank @@
+Normal rank