24 citations · 38 across the 14 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DS2016★ 1 cited
Global and fixed-terminal cuts in digraphs
Kristóf Bérczi, Karthekeyan Chandrasekaran, Tamás Király +2
The computational complexity of multicut-like problems may vary significantly depending on whether the terminals are fixed or not. In this work we present a comprehensive study of…
cs.DS2016
Computing minimum cuts in hypergraphs
Chandra Chekuri, Chao Xu
We study algorithmic and structural aspects of connectivity in hypergraphs. Given a hypergraph with , and the best known algor…