no code implementations • 21 Feb 2018 • L. Sunil Chandran, Yun Kuen Cheung, Davis Issac
We also present another algorithm for computing a spanning tree with congestion $\mathcal{O}(\sqrt{mn})$; this algorithm runs in sub-exponential time when $m = \omega(n \log^2 n)$.
Data Structures and Algorithms Computational Complexity Discrete Mathematics
