Minimum Cuts and Sparsification in Hypergraphs
作者： Chandra Chekuri , Chao Xu
DOI: 10.1137/18M1163865
关键词:
摘要: We study algorithmic and structural aspects of connectivity in hypergraphs. Given a hypergraph $H=(V,E)$ with $n = |V|$, $m |E|$, $p \sum_{e \in E} |e|$ the fastest known algorithm to compu...
sci-hub.se 参考文章(0)