Search Results - sublinear and near linear time algorithms phrases testing algorithms~

Computing and Testing Small Connectivity in Near-Linear Time and Queries via Fast Local Cut Algorithms by ster, Sebastian, Nanongkai, Danupon, Saranurak, Thatchaphol, Liu, Yang, Yingchareonthawornchai, Sorrachai

“…)\) edges reachable from \(x\). We present a simple randomized algorithm spending \(O(k^2\nu)\) time and \(O(k\nu)\) queries for the above variant, improving…”
Get full text