Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1161250
- On computing a conditional edge-connectivity of a graph
- Computation and algorithm for the minimum \(k\)-edge-connectivity of graphs
- scientific article; zbMATH DE number 2097434
- Edge-connectivity in hypergraphs
- Edge-connectivities of graphs and digraphs
- On optimizing restricted edge connectivity of graphs
- On computing the connectivities of graphs and digraphs
- APPROXIMATING MINIMUM COST MULTIGRAPHS OF SPECIFIED EDGE-CONNECTIVITY UNDER DEGREE BOUNDS(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
- On the generalized (edge-)connectivity of graphs
Cited in
(85)- On computing a conditional edge-connectivity of a graph
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- A linear time algorithm for computing 3-edge-connected components in a multigraph
- A new and improved algorithm for the 3-cut problem
- Minimizing symmetric submodular functions
- Random sampling and greedy sparsification for matroid optimization problems
- Computing maximum mean cuts
- Efficient computation of implicit representations of sparse graphs
- Inverse maximum capacity problems
- A note on the minimization of symmetric and general submodular functions
- On the cut polyhedron.
- A clustering algorithm based on graph connectivity
- Blocking unions of arborescences
- Blocking optimal structures
- Greedy splitting algorithms for approximating multiway partition problems
- Connectivity interdiction
- Implementing an efficient minimum capacity cut algorithm
- Polyhedral structure of submodular and posi-modular systems
- A fully combinatorial algorithm for submodular function minimization.
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
- Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
- Faster connectivity in low-rank hypergraphs via expander decomposition
- Graph searches and their end vertices
- Finding densest \(k\)-connected subgraphs
- A fast algorithm for cactus representations of minimum cuts
- Computing vertex-disjoint paths in large graphs using MAOs
- Symmetric submodular system: contractions and Gomory-Hu tree
- Some inverse min-max network problems under weighted \(l_1\) ans \(l_{\infty}\) norms with bound constraints on changes
- On the (co)girth of a connected matroid
- A min-cut approach to functional regionalization, with a case study of the Italian local labour market areas
- Faster cut sparsification of weighted graphs
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
- Realizing symmetric set functions as hypergraph cut capacity
- A note on minimizing submodular functions
- Minimum cuts and shortest cycles in directed planar graphs via noncrossing shortest paths
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
- scientific article; zbMATH DE number 437577 (Why is no real title available?)
- Efficient Algorithms for the k Smallest Cuts Enumeration
- Minimum Cuts of Simple Graphs in Almost Always Linear Time
- Minimum cuts and sparsification in hypergraphs
- The capacity formulation of the capacitated edge activation problem
- Practical minimum cut algorithms
- Faster algorithms for next breakpoint and max value for parametric global minimum cuts
- Recent developments in maximum flow algorithms
- Fast and deterministic approximations for \(k\)-cut
- Computing vertex-disjoint paths in large graphs using MAOs
- A cut tree representation for pendant pairs
- A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem
- Randomized contractions for multiobjective minimum cuts
- A general framework for graph sparsification
- Faster algorithms for shortest path and network flow based on graph decomposition
- Randomized approximation schemes for cuts and flows in capacitated graphs
- Cache oblivious minimum cut
- A reactive GRASP with path relinking for capacitated clustering
- Optimizing in Graphs with Expensive Computation of Edge Weights
- Global minimum cuts in surface embedded graphs
- scientific article; zbMATH DE number 7651198 (Why is no real title available?)
- Fast and Deterministic Approximations for k-Cut.
- Minimum Cuts in Surface Graphs
- Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)
- A network flow model of group technology
- Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties
- Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
- Complexity of (arc)-connectivity problems involving arc-reversals or deorientations
- Generalized cut trees for edge-connectivity
- Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem
- Finding a small vertex cut on distributed networks
- A polynomial time algorithm for finding a minimum 4-partition of a submodular function
- Minimum cut in \(O(m \log^2 n)\) time
- Minimum cut in O(m^2 n time
- Two strongly polynomial cut cancelling algorithms for minimum cost network flow
- Deterministic minimum cut in poly-logarithmic maximum flows
- Graph connectivity and its augmentation: Applications of MA orderings
- Minimum s-t hypercut in (s, t)-planar hypergraphs
- Heuristics for the central tree problem
- Finding minimum 3-way cuts in hypergraphs
- Minimum augmentation of edge-connectivity between vertices and sets of vertices in undirected graphs
- Minimum degree orderings
- Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
- Minimum augmentation of local edge-connectivity between vertices and vertex subsets in undirected graphs
- Sparse connectivity certificates via MA orderings in graphs
- 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
- Optimal cuts in graphs and statistical mechanics
- Submodular function minimization
This page was built for publication: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3989010)
