Algorithmic Aspects of Graph Connectivity
From MaRDI portal
Recommendations
Cited in
(54)- Greedy approximation for the source location problem with vertex-connectivity requirements in undirected graphs
- Quantum graphs which optimize the spectral gap
- Sparse certificates for 2-connectivity in directed graphs
- Speeding up the Gomory-Hu parallel cut tree algorithm with efficient graph contractions
- In search of the densest subgraph
- Phase retrieval of complex and vector-valued functions
- Graph searches and their end vertices
- Computing vertex-disjoint paths in large graphs using MAOs
- Symmetric submodular system: contractions and Gomory-Hu tree
- A metric to compare vulnerability of the graphs of different sizes
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
- An O^(1.84ᵏ) parameterized algorithm for the multiterminal cut problem
- Mean isoperimetry with control on outliers: exact and approximation algorithms
- A simple certifying algorithm for 3-edge-connectivity
- Approximating source location and star survivable network problems
- On computing the connectivities of graphs and digraphs
- Finding 2-edge and 2-vertex strongly connected components in quadratic time
- Approximating the smallest spanning subgraph for 2-edge-connectivity in directed graphs
- On the robustness to multiple agent losses in 2D and 3D formations
- Structured connectivity augmentation
- Minimum cuts and sparsification in hypergraphs
- GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(<Special Issue>Network Design, Control and Optimization)
- One-way trail orientations
- Network connectivity. Concepts, computation, and optimization
- Depth functions and mutidimensional medians on minimal spanning trees
- Faster algorithms for next breakpoint and max value for parametric global minimum cuts
- Computing vertex-disjoint paths in large graphs using MAOs
- Structured connectivity augmentation
- Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions
- Approximating source location and star survivable network problems
- The firebreak problem
- Minimum shared‐power edge cut
- The double-bubble problem on the square lattice
- A classification method based on a cloud of spheres
- A note on the connectivity of the exchanged hypercube
- Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k
- Splitting-off in hypergraphs
- Splitting-off in hypergraphs
- Connectivity-faithful graph drawing
- Computing the 4-edge-connected components of a graph: an experimental study
- On maximal k-edge-connected subgraphs of undirected graphs
- Protecting the connectivity of a graph under non-uniform edge failures
- On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
- Protecting the connectivity of a graph under nonuniform edge failures
- Higher connectivity in directed graphs (invited talk)
- Faster dynamic 2-edge connectivity in directed graphs
- Efficient contractions of dynamic graphs -- with applications
- A linear-delay algorithm for enumerating strongly-connected induced subgraphs based on SSD set system
- Light edge fault tolerant graph spanners
- A new parameter for a broadcast algorithm with locally bounded Byzantine faults
- On the complexity of isoperimetric problems on trees
- Static and dynamic source locations in undirected networks
- Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs
- Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
This page was built for publication: Algorithmic Aspects of Graph Connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3543582)
