Extracting maximal information about sets of minimum cuts
From MaRDI portal
directed acyclic graphnetwork reliabilityminimum edge cutsedge-connectivity cutsunweighted graphweighted, undirected graph
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Abstract computational complexity for mathematical programming problems (90C60) Connectivity (05C40)
Recommendations
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- A Fast Parametric Maximum Flow Algorithm and Applications
- A new approach to the maximum-flow problem
- A paradigm for listing \((s,t)\)-cuts in graphs
- An algorithm to generate the ideals of a partial order
- Bottlenecks and Edge Connectivity in Unsymmetrical Networks
- Calculating bounds on reachability and connectedness in stochastic networks
- Counting almost minimum cutsets with reliability applications
- Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
- Efficient algorithms for generalized cut‐trees
- Extracting maximal information about sets of minimum cuts
- Finding the edge connectivity of directed graphs
- Multi-Terminal Network Flows
- Multi-terminal maximum flows in node-capacitated networks
- Network Flow and Testing Graph Connectivity
- On computing the connectivities of graphs and digraphs
- On the structure of all minimum cuts in a network and applications
- Selected Applications of Minimum Cuts in Networks
- Solution Bases of Multiterminal Cut Problems
- The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds
- Three Fast Algorithms for Four Problems in Stable Marriage
- Very Simple Methods for All Pairs Network Flow Analysis
Cited in
(20)- Efficient algorithms for computing all low \(s\)-\(t\) edge connectivities and related problems
- scientific article; zbMATH DE number 913348 (Why is no real title available?)
- Efficient algorithm for computing all low \(s\)-\(t\) edge connectivities in directed graphs
- On enumerating minimal dicuts and strongly connected subgraphs
- Tight lower bounds for the number of inclusion-minimal \(st\)-cuts
- Counterexamples for Directed and Node Capacitated Cut-Trees
- Minimal cuts in two-terminal directed acyclic graphs
- Enumerating disjunctions and conjunctions of paths and cuts in reliability theory
- scientific article; zbMATH DE number 5242380 (Why is no real title available?)
- Extracting maximal information about sets of minimum cuts
- Network Analysis
- Multiterminal xcut problems
- Generalized cut trees for edge-connectivity
- Generating cut conjunctions in graphs and related problems
- All-pairs min-cut in sparse networks
- Connectivity algorithms
- Nested Graphs
- Compact cactus representations of all non-trivial min-cuts
- Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay
- An efficient approximation algorithm for the survivable network design problem
This page was built for publication: Extracting maximal information about sets of minimum cuts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1261290)
