Approximate minimum cuts and their enumeration
| Autor: | Beideman, Calvin, Chandrasekaran, Karthekeyan, Wang, Weihang |
|---|---|
| Rok vydání: | 2022 |
| Předmět: | |
| Druh dokumentu: | Working Paper |
| Popis: | We show that every $\alpha$-approximate minimum cut in a connected graph is the unique minimum $(S,T)$-terminal cut for some subsets $S$ and $T$ of vertices each of size at most $\lfloor2\alpha\rfloor+1$. This leads to an alternative proof that the number of $\alpha$-approximate minimum cuts in a $n$-vertex connected graph is $n^{O(\alpha)}$ and they can all be enumerated in deterministic polynomial time for constant $\alpha$. Comment: Accepted to SOSA'23 |
| Databáze: | arXiv |
| Externí odkaz: |
|