Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
From MaRDI portal
Publication:848944
DOI10.1007/S00453-009-9284-5zbMATH Open1187.68689OpenAlexW2020816761MaRDI QIDQ848944FDOQ848944
Authors: Li-Pu Yeh, Biing-Feng Wang, Hsin-Hao Su 
Publication date: 23 February 2010
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-009-9284-5
Recommendations
Cites Work
- Network flows. Theory, algorithms, and applications.
- A new approach to the maximum-flow problem
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- A Faster Deterministic Maximum Flow Algorithm
- Multi-Terminal Network Flows
- A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
- A new approach to the minimum cut problem
- Computing All Small Cuts in an Undirected Network
- 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
- On the structure of all minimum cuts in a network and applications
- A new and improved algorithm for the 3-cut problem
- Minimum cuts in near-linear time
- Practical performance of efficient minimum cut algorithms
- Title not available (Why is that?)
- Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
- A fast algorithm for computing minimum 3-way and 4-way cuts
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts
- Implementing an efficient minimum capacity cut algorithm
- A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
- A divide-and-conquer approach to the minimum \(k\)-way cut problem.
- A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
- Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
Cited In (11)
- Title not available (Why is that?)
- A polynomial time algorithm for finding a minimum 4-partition of a submodular function
- Title not available (Why is that?)
- Minimum Violation Vertex Maps and Their Applications to Cut Problems
- 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
- Must the communication graph of MPC protocols be an expander?
- Title not available (Why is that?)
- Enumerating all solutions of a Boolean CSP by non-decreasing weight
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)
