Graph connectivity and its augmentation: Applications of MA orderings
From MaRDI portal
Recommendations
- GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(<Special Issue>Network Design, Control and Optimization)
- scientific article; zbMATH DE number 1670666
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- NEW MAXIMUM FLOW ALGORITHMS BY MA ORDERMGS AND SCALING
- Sparse connectivity certificates via MA orderings in graphs
Cites work
- scientific article; zbMATH DE number 1617267 (Why is no real title available?)
- scientific article; zbMATH DE number 437577 (Why is no real title available?)
- scientific article; zbMATH DE number 1187145 (Why is no real title available?)
- scientific article; zbMATH DE number 3685495 (Why is no real title available?)
- scientific article; zbMATH DE number 177556 (Why is no real title available?)
- scientific article; zbMATH DE number 1256719 (Why is no real title available?)
- scientific article; zbMATH DE number 1303025 (Why is no real title available?)
- scientific article; zbMATH DE number 1303026 (Why is no real title available?)
- scientific article; zbMATH DE number 1303565 (Why is no real title available?)
- scientific article; zbMATH DE number 1303567 (Why is no real title available?)
- scientific article; zbMATH DE number 1342136 (Why is no real title available?)
- scientific article; zbMATH DE number 1104329 (Why is no real title available?)
- scientific article; zbMATH DE number 1102774 (Why is no real title available?)
- scientific article; zbMATH DE number 1175959 (Why is no real title available?)
- scientific article; zbMATH DE number 1775390 (Why is no real title available?)
- scientific article; zbMATH DE number 1405799 (Why is no real title available?)
- scientific article; zbMATH DE number 6472607 (Why is no real title available?)
- scientific article; zbMATH DE number 3314878 (Why is no real title available?)
- A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
- A Reduction Method for Edge-Connectivity in Graphs
- A fast algorithm for cactus representations of minimum cuts
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- A minimum 3-connectivity augmentation of a graph
- A new approach to the minimum cut problem
- A note on minimizing submodular functions
- A note on mixed graphs and directed splitting off
- A note on the vertex-connectivity augmentation problem
- A simple min-cut algorithm
- A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs
- A unifying augmentation algorithm for two-edge connectivity and biconnectivity
- ANOTHER SIMPLE PROOF OF THE VALIDITY OF NAGAMOCHI AND IBARAKI'S MIN-CUT ALGORITHM AND QUEYRANNE'S EXTENSION TO SYMMETRIC SUBMODULAR FUNCTION MINIMIZATION
- An $\NC$ Algorithm for Minimum Cuts
- An Õ(n2) algorithm for minimum cuts
- An efficient algorithm for the minimum capacity cut problem
- Augmentation Problems
- Augmenting Edge-Connectivity over the Entire Range inÕ(nm) Time
- Augmenting Graphs to Meet Edge-Connectivity Requirements
- Augmenting Outerplanar Graphs
- Augmenting undirected connectivity in RNC and in randomized \(\tilde{O}(n^3)\) time
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- Computing Vertex Connectivity: New Bounds from Old Techniques
- Data Security Equals Graph Connectivity
- Deterministic \(\tilde O(nm)\) time edge-splitting in undirected graphs
- Directed vertex-connectivity augmentation
- Edge-Connectivity Augmentation Preserving Simplicity
- Edge-Connectivity Augmentation with Partition Constraints
- Edge-connectivity augmentation problems
- Efficient splitting off algorithms for graphs
- Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
- Fibonacci heaps and their uses in improved network optimization algorithms
- Finding a Smallest Augmentation to Biconnect a Graph
- How to Make a Square Grid Framework with Cables Rigid
- Implementing an efficient minimum capacity cut algorithm
- Konstruktion aller n-fach kantenzusammenhaengenden Digraphen
- Minimal edge-coverings of pairs of sets
- Minimizing symmetric submodular functions
- Minimum block containing a given graph
- Multigraph augmentation under biconnectivity and general edge-connectivity requirements
- Network flows. Theory, algorithms, and applications.
- On Four-Connecting a Triconnected Graph
- On minimizing symmetric set functions
- On sparse subgraphs preserving connectivity properties
- On the optimal vertex-connectivity augmentation
- On the structure of all minimum cuts in a network and applications
- Optimal Mixed Graph Augmentation
- Optimal augmentation of a 2-vertex-connected multigraph to an \(\ell\)-edge-connected and 3-vertex-connected multigraph
- Polyhedral structure of submodular and posi-modular systems
- Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
- Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
- Successive edge-connectivity augmentation problems
- The minimum augmentation of any graph to aK-edge-connected graph
- Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract)
Cited in
(15)- Augmenting forests to meet odd diameter requirements
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
- GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(<Special Issue>Network Design, Control and Optimization)
- On the minimum local-vertex-connectivity augmentation in graphs
- Minimum Cuts of Simple Graphs in Almost Always Linear Time
- Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs
- Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
- Regular augmentation of planar graphs
- Sparse connectivity certificates via MA orderings in graphs
- The \((2, k)\)-connectivity augmentation problem: algorithmic aspects
- A maximum flow algorithm using MA ordering.
- Augmenting edge-connectivity between vertex subsets
- Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs
- Augmenting the edge connectivity of planar straight line graphs to three
- Connectivity augmentation in planar straight line graphs
This page was built for publication: Graph connectivity and its augmentation: Applications of MA orderings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697579)
