You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
@@ -15,11 +16,13 @@ The algorithm performs repeated rounds of **provably exact reduction rules** tha
15
16
HeiCut is presented in the paper:
16
17
> *Exact Minimum Cuts in Hypergraphs at Scale*, ALENEX 2026.
17
18
18
-
The GitHub repository (https://github.com/HeiCut/HeiCut.git) provides:
19
+
This repository provides:
19
20
- Source code for **HeiCut**
20
21
- Implementations of competing algorithms: **Trimmer**, **Relaxed BIP**, and **ordering-based solvers**
21
22
- Benchmark datasets (`M_{HG}`, `L_{HG}`, and $(k,2)$-core)
22
-
- Scripts to **reproduce all experimental results** from the paper
23
+
- Scripts to **reproduce all experimental results** from the paper
24
+
25
+
The source code and benchmark datasets are permanently archived on [Zenodo Software](https://doi.org/10.5281/zenodo.17140473) and [Zenodo Dataset](https://doi.org/10.5281/zenodo.17142170) to ensure long-term availability.
23
26
24
27
---
25
28
@@ -211,7 +214,7 @@ We evaluate on three datasets:
211
214
-**(k,2)-core** (44 synthetic instances with non-trivial cuts): Weighted and Unweighted
212
215
213
216
Download all datasets here:
214
-
[📂 Google Drive Link](https://drive.google.com/drive/folders/1DkGrmtd73nHMz2DzE0zsS175gNmD3qVU?usp=sharing)
0 commit comments