Weihang Wang

activity

20202025

most citedDeterministic enumeration of all minimum cut-sets and

k

-cut-sets in hypergraphs for fixed

k

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

collaborators

Showing 2021Show all

2 papers · 1 filter

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.DS2021

$ℓ_{p}$ -norm Multiway Cut

Karthekeyan Chandrasekaran, Weihang Wang

We introduce and study $ℓ_{p}$ -norm-multiway-cut: the input here is an undirected graph with non-negative edge weights along with $k$ terminals and the goal is to find a partition…

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

ℓp​-norm Multiway Cut

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

$ℓ_{p}$ -norm Multiway Cut