Practical Minimum Cut Algorithms
From MaRDI portal
Publication:4629534
DOI10.1145/3274662zbMath1430.68215arXiv1708.06127OpenAlexW2746372354MaRDI QIDQ4629534
Darren Strash, Alexander Noe, Christian Schulz, Monika R. Henzinger
Publication date: 27 March 2019
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.06127
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
In search of dense subgraphs: How good is greedy peeling? ⋮ Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient algorithm for the minimum capacity cut problem
- Implementing an efficient minimum capacity cut algorithm
- Practical performance of efficient minimum cut algorithms
- Fast algorithms for determining (generalized) core groups in social networks
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
- Deterministic Global Minimum Cut of a Simple Graph in Near-Linear Time
- Maximal Flow Through a Network
- An Improved Min-Cut Algonthm for Partitioning VLSI Networks
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Generating Random Hyperbolic Graphs in Subquadratic Time
- Counting almost minimum cutsets with reliability applications
- A new approach to the maximum-flow problem
- Multi-Terminal Network Flows
- Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
- A new approach to the minimum cut problem
- A simple min-cut algorithm
- Local Flow Partitioning for Faster Edge Connectivity
- (Semi-)External Algorithms for Graph Partitioning and Clustering
- An improved equivalence algorithm
- Minimum cuts in near-linear time
- On the Analysis of a Label Propagation Algorithm for Community Detection
- Experimental and Efficient Algorithms
This page was built for publication: Practical Minimum Cut Algorithms
