https://github.com/nalinbhardwaj/min-cut-paper
A Simple Algorithm for Minimum Cuts in Near-Linear Time (SWAT '20)
https://github.com/nalinbhardwaj/min-cut-paper
implementation min-cut paper research
Last synced: 10 days ago
JSON representation
A Simple Algorithm for Minimum Cuts in Near-Linear Time (SWAT '20)
- Host: GitHub
- URL: https://github.com/nalinbhardwaj/min-cut-paper
- Owner: nalinbhardwaj
- License: mit
- Created: 2020-04-15T19:13:13.000Z (about 5 years ago)
- Default Branch: master
- Last Pushed: 2020-04-24T01:26:39.000Z (about 5 years ago)
- Last Synced: 2025-04-22T14:09:27.057Z (10 days ago)
- Topics: implementation, min-cut, paper, research
- Language: C++
- Homepage: https://arxiv.org/abs/1908.11829
- Size: 644 KB
- Stars: 12
- Watchers: 7
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# min-cut-paper
Implementation of https://arxiv.org/abs/1908.11829
# Usage
- Compile
```bash
g++ -Wall -Werror -Wextra -std=c++11 main.cpp -o main -O2
```
- Run
```bash
./main < input/1.in
```
- Input Format
First, read an undirected weighted graph of the form:
```
n m
u_1 v_1 w_1
u_2 v_2 w_2
.
.
.
u_m v_m w_m
```
where n is the number of vertices, m the number of edges, and w_i is the weight
of the ith edge. Edge weights are read into double-precision floating point
numbers. We assume 0-based indexing for u_i and v_i.
Followed by:
```
d
```
The variable `d` is the exponent in the probability of success 1 − 1/(n)^d for Algorithm 2.