Calvin Beideman

activity

20142022

most citedSet Families with Low Pairwise Intersection

3 citations · 5 across the 5 of their papers we have counts for

collaborators

Showing 2020Show all

2 papers · 1 filter

cs.DS2020

Faster connectivity in low-rank hypergraphs via expander decomposition

Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay +1

We design an algorithm for computing connectivity in hypergraphs which runs in time $O^_{r} (p + min {λ^{\frac{r - 3}{r - 1}} n^{2}, n^{r} / λ^{r / (r - 1)}})$ (the $O^_{r} (\cdot)$ hides th…

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…

Faster connectivity in low-rank hypergraphs via expander decomposition

Multicritera Cuts and Size-Constrained k-cuts in Hypergraphs

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