Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms
Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms
Previous chapter Next chapter Full AccessProceedings Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA)Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut AlgorithmsSebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, and Sorrachai YingchareonthawornchaiSebastian Forster, Danupon Nanongkai, Liu Yang, Thatchaphol Saranurak, and Sorrachai Yingchareonthawornchaipp.2046 …