Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition

Calvin Beideman, Karthekeyan Chandrasekaran, Sagnik Mukhopadhyay, Danupon Nanongkai. Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition. In Karen Aardal, Laura Sanità, editors, Integer Programming and Combinatorial Optimization - 23rd International Conference, IPCO 2022, Eindhoven, The Netherlands, June 27-29, 2022, Proceedings. Volume 13265 of Lecture Notes in Computer Science, pages 70-83, Springer, 2022. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.