Efficient Algorithms for the k Smallest Cuts Enumeration

DOI10.1007/978-3-540-69733-6_43zbMath1148.05319OpenAlexW115251405MaRDI QIDQ3511355

Biing-Feng Wang, Li-Pu Yeh

Publication date: 10 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69733-6_43

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• 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
• 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
• On minimum 3-cuts and approximating k-cuts using Cut Trees
• Building Chain and Cactus Representations of All Minimum Cuts from Hao–Orlin in the Same Asymptotic Run Time
• Suboptimal cuts: Their enumeration, weight and number
• Minimum cuts in near-linear time
• A divide-and-conquer approach to the minimum \(k\)-way cut problem.

This page was built for publication: Efficient Algorithms for the k Smallest Cuts Enumeration