Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
From MaRDI portal
Publication:848944
DOI10.1007/s00453-009-9284-5zbMath1187.68689OpenAlexW2020816761MaRDI QIDQ848944
Biing-Feng Wang, Hsin-Hao Su, Li-Pu Yeh
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
Related Items (4)
Efficient pattern matching on big uncertain graphs ⋮ Minimum Violation Vertex Maps and Their Applications to Cut Problems ⋮ Must the communication graph of MPC protocols be an expander? ⋮ Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new and improved algorithm for the 3-cut problem
- A faster algorithm for computing minimum 5-way and 6-way cuts in graphs
- A fast algorithm for computing minimum 3-way and 4-way cuts
- Implementing an efficient minimum capacity cut algorithm
- Practical performance of efficient minimum cut algorithms
- Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
- A new approach to the maximum-flow problem
- Multi-Terminal Network Flows
- On the structure of all minimum cuts in a network and applications
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
- A Polynomial Algorithm for the k-cut Problem for Fixed k
- A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
- A Faster Deterministic Maximum Flow Algorithm
- A new approach to the minimum cut problem
- Computing All Small Cuts in an Undirected Network
- Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
- A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
- Minimum cuts in near-linear time
- Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts
- A divide-and-conquer approach to the minimum \(k\)-way cut problem.
This page was built for publication: Efficient algorithms for the problems of enumerating cuts by non-decreasing weights
