Calvin Beideman

activity

20182022

most citedDeterministic enumeration of all minimum cut-sets and

k

-cut-sets in hypergraphs for fixed

k

1 citations · 1 across the 2 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2022

Approximate minimum cuts and their enumeration

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

We show that every $α$ -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 $\lfloo…

cs.DS2021★ 1 cited

Deterministic enumeration of all minimum cut-sets and $k$ -cut-sets in hypergraphs for fixed $k$

Calvin Beideman, Karthekeyan Chandrasekaran, Weihang Wang

We consider the problem of deterministically enumerating all minimum $k$ -cut-sets in a given hypergraph for any fixed $k$ . The input here is a hypergraph $G = (V, E)$ with non-nega…

cs.DS2020

Multicritera Cuts and Size-Constrained $k$ -cuts in Hypergraphs

Calvin Beideman, Karthekeyan Chandrasekaran, Chao Xu

We address counting and optimization variants of multicriteria global min-cut and size-constrained min- $k$ -cut in hypergraphs. 1. For an $r$ -rank $n$ -vertex hypergraph endowed with…

Approximate minimum cuts and their enumeration

Deterministic enumeration of all minimum cut-sets and k-cut-sets in hypergraphs for fixed k

Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs

Deterministic enumeration of all minimum cut-sets and $k$ -cut-sets in hypergraphs for fixed $k$

Multicritera Cuts and Size-Constrained $k$ -cuts in Hypergraphs