scientific article; zbMATH DE number 7651198
From MaRDI portal
Publication:5874530
DOI10.4230/LIPIcs.ESA.2020.59MaRDI QIDQ5874530
Darren Strash, Christian Schulz, Alexander Noe, Monika R. Henzinger
Publication date: 7 February 2023
Full work available at URL: https://arxiv.org/abs/2002.06948
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
graph algorithmminimum cutalgorithm engineeringbalanced cutglobal minimum cutcut enumerationlarge-scale graph analysis
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Exact algorithms for cluster editing: Evaluation and experiments
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- Most balanced minimum cuts
- Canonical cactus representation for miminum cuts
- A clustering algorithm based on graph connectivity
- Implementing an efficient minimum capacity cut algorithm
- Practical performance of efficient minimum cut algorithms
- A fast algorithm for cactus representations of minimum cuts
- A Randomized Fully Polynomial Time Approximation Scheme for the All-Terminal Network Reliability Problem
- Turbo-Charging Dominating Set with an FPT Subroutine: Further Improvements and Experimental Analysis
- The university of Florida sparse matrix collection
- Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
- An Improved Min-Cut Algonthm for Partitioning VLSI Networks
- Counting almost minimum cutsets with reliability applications
- 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 new approach to the minimum cut problem
- A Fast Algorithm for Optimally Increasing the Edge Connectivity
- Practical Minimum Cut Algorithms
- Practical Access to Dynamic Programming on Tree Decompositions
- Data Reduction for Maximum Matching on Real-World Graphs: Theory and Experiments
- Positive-Instance Driven Dynamic Programming for Treewidth.
- Faster Algorithms for Edge Connectivity via Random 2-Out Contractions
- Engineering Kernelization for Maximum Cut
- Shared-Memory Branch-and-Reduce for Multiterminal Cuts
- Scalable Kernelization for Maximum Independent Sets
- Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs
- Minimum cuts in near-linear time
- Depth-First Search and Linear Graph Algorithms
- Experimental and Efficient Algorithms
- Sparse matrices
This page was built for publication:
