All public logs

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 11:16, 15 February 2023 Admin talk contribs created page Ruchansky (Minimum Wiener Connector problem Wiener Index) (Created page with "== Time Complexity == $O(q(m*log(n)$+n*log^{2}(n))) == Space Complexity == $O(q(m+n*log(n)$)? words (Keeps track of $O(qm)$ shortest-path distances and $O(q*log(n))$ approximate Steiner trees, each of size $O(n)$) == Description == == Approximate? == Approximate Approximation Factor: O(1) == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2015 == Reference == https://arxiv.org/abs/1504.00513")