Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 5485527 (Why is no real title available?)
- scientific article; zbMATH DE number 1445372 (Why is no real title available?)
- scientific article; zbMATH DE number 6472607 (Why is no real title available?)
- A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
- A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
- A Faster Deterministic Maximum Flow Algorithm
- A Polynomial Algorithm for the k-cut Problem for Fixed k
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
- A divide-and-conquer approach to the minimum \(k\)-way cut problem.
- A fast algorithm for computing minimum 3-way and 4-way cuts
- A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
- A new and improved algorithm for the 3-cut problem
- A new approach to the maximum-flow problem
- A new approach to the minimum cut problem
- Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts
- Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
- Computing All Small Cuts in an Undirected Network
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
- Implementing an efficient minimum capacity cut algorithm
- Minimum cuts in near-linear time
- Multi-Terminal Network Flows
- Network flows. Theory, algorithms, and applications.
- On the structure of all minimum cuts in a network and applications
- Practical performance of efficient minimum cut algorithms
Cited in
(14)- A generalized framework for listing cuts and graphs
- scientific article; zbMATH DE number 1750489 (Why is no real title available?)
- A polynomial time algorithm for finding a minimum 4-partition of a submodular function
- scientific article; zbMATH DE number 2050721 (Why is no real title available?)
- Efficient Algorithms for the Label Cut Problems
- Efficient Algorithms for the k Smallest Cuts Enumeration
- Efficient pattern matching on big uncertain graphs
- Covering a graph with densest subgraphs
- Minimum violation vertex maps and their applications to cut problems
- Suboptimal cuts: their enumeration, weight and number (extended abstract)
- scientific article; zbMATH DE number 7559431 (Why is no real title available?)
- Must the communication graph of MPC protocols be an expander?
- Enumerating all solutions of a Boolean CSP by non-decreasing weight
- Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay
This page was built for publication: Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848944)
