Faster connectivity in low-rank hypergraphs via expander decomposition
share
We design an algorithm for computing connectivity in hypergraphs which runs in time Ô_r(p + min{λ n^2, n^r/λ}) (the Ô_r(·) hides the terms subpolynomial in the main parameter and terms that depend only on r) where p is the size, n is the number of vertices, and r is the rank of the hypergraph. Our algorithm is faster than existing algorithms when the connectivity λ is Ω(n^(r-2)/2). At the heart of our algorithm is a structural result regarding min-cuts in simple hypergraphs. We show a trade-off between the number of hyperedges taking part in all min-cuts and the size of the smaller side of the min-cut. This structural result can be viewed as a generalization of a well-known structural theorem for simple graphs [Kawarabayashi-Thorup, JACM 19]. We extend the framework of expander decomposition to simple hypergraphs in order to prove this structural result. We also make the proof of the structural result constructive to obtain our faster hypergraph connectivity algorithm.
READ FULL TEXT
