New pages
Jump to navigation
Jump to search
(newest | oldest) View (newer 50 | older 50) (20 | 50 | 100 | 250 | 500)
- 10:38, 15 February 2023 Shanks's square forms factorization (SQUFOF) (Second Category Integer Factoring Integer Factoring) (hist | edit) [378 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^{(n/{4})$}) == Space Complexity == $O(n)$? bits (Constant number of O(n)-bit integers) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 2007 == Reference == https://www.ams.org/journals/mcom/2008-77-261/S0025-5718-07-02010-8/S0025-5718-07-02010-8.pdf")
- 10:38, 15 February 2023 Rational sieve (Second Category Integer Factoring Integer Factoring) (hist | edit) [424 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(e^{sqrt(({2}+o({1})$)n*logn)}) == Space Complexity == $O(n+(B/logB)$^{2})? bits (Same general approach as Dixon's algorithm) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1993 == Reference == https://www.ams.org/journals/mcom/1993-61-203/S0025-5718-1993-1182953-4/S0025-5718-1993-1182953-4.pdf")
- 10:38, 15 February 2023 Quadratic sieve (Second Category Integer Factoring Integer Factoring) (hist | edit) [429 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == - == Space Complexity == $O(n+(B/logB)$^{2})? bits (Same general approach as Dixon's algorithm) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1981 == Reference == https://www.semanticscholar.org/paper/Analysis-and-comparison-of-some-integer-factoring-Pomerance/134b7b065a73d4ca00bb16c7b8bebbde951b0ba0")
- 10:38, 15 February 2023 Continued fraction factorization (CFRAC) (Second Category Integer Factoring Integer Factoring) (hist | edit) [413 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(e^{\sqrt({2}n*logn)})$ == Space Complexity == $O(n+(B/logB)$^{2})? bits (Same as above? assuming there is a bound parameter implemented) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1931 == Reference == https://www.ams.org/journals/bull/1931-37-10/S0002-9904-1931-05271-X/home.html")
- 10:38, 15 February 2023 Dixon's algorithm (Second Category Integer Factoring Integer Factoring) (hist | edit) [643 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(e^{({2} \sqrt({2}) \sqrt(n*logn))}){4} == Space Complexity == $O(n+(B/logB)$^{2})? bits (There are pi(B) = O(B/log B) primes in the factor base; need pi(B)+1=O(B/log B) relations involving an integer (which doesn't need to be kept track of) and a pi(B)-bit string of exponents. Also need O(n) bits to perform other computations. Rest is irrelevant asymptotically) == Description == == Approximate? == Exact == Randomized? == No, deter...")
- 10:38, 15 February 2023 Euler's factorization method (First Category Integer Factoring Integer Factoring) (hist | edit) [310 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^{(n/{2})})$ == Space Complexity == $O(n)$ auxiliary bits (constant number of values which require at most O(n) bits) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1940 == Reference == -")
- 10:38, 15 February 2023 Fermat's factorization method (First Category Integer Factoring Integer Factoring) (hist | edit) [351 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^n)$ == Space Complexity == $O(n)$ auxiliary bits (constant number of values which require at most O(n) bits) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1894 == Reference == https://archive.org/details/oeuvresdefermat02ferm")
- 10:38, 15 February 2023 Lenstra elliptic curve factorization (First Category Integer Factoring Integer Factoring) (hist | edit) [384 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(e^{(\sqrt(({1}+o({1}))n*log n))})$ == Space Complexity == $O(n)$ auxiliary? bits (constant number of values which are expressed in mod N) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1987 == Reference == https://www.jstor.org/stable/1971363?origin=crossref&seq=1")
- 10:38, 15 February 2023 Williams' p + 1 algorithm (First Category Integer Factoring Integer Factoring) (hist | edit) [351 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^ (n))$ == Space Complexity == $O(n)$ auxiliary? bits (constant number of values which are expressed in mod N) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1982 == Reference == https://www.jstor.org/stable/2007633?origin=crossref")
- 10:38, 15 February 2023 Pollard's p − 1 algorithm (First Category Integer Factoring Integer Factoring) (hist | edit) [543 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(B*log B*log^{2}(n)$)? == Space Complexity == $O(n+B)$ auxiliary bits (the number M requires O((log B)*pi(B)) = O(B) bits, and the other numbers require O(n) bits) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1974 == Reference == https://www.cambridge.org/core/journals/mathematical-proceedings-of-the-cambridge-philosophical-society/article/th...")
- 10:38, 15 February 2023 Pollard's rho algorithm (First Category Integer Factoring Integer Factoring) (hist | edit) [363 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == - == Space Complexity == $O(n)$ auxiliary bits (keep track of g (the polynomial; O(1) space), x, y, and d (all O(n) space)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1975 == Reference == https://link.springer.com/article/10.1007%2FBF01933667")
- 10:38, 15 February 2023 Wheel factorization (First Category Integer Factoring Integer Factoring) (hist | edit) [362 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^{n/2})$ == Space Complexity == $O(n)$ auxiliary bits (need to keep track of what number you're currently checking, along with o(n) bits for the wheel (assuming it's small)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1940 == Reference ==")
- 10:38, 15 February 2023 Trial division (First Category Integer Factoring Integer Factoring) (hist | edit) [308 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O({2}^{n/2})$ == Space Complexity == $O(n)$ auxiliary bits (need to keep track of what number you're currently checking) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? == Year == 1202 == Reference == -")
- 10:38, 15 February 2023 Chan (APSP on Dense Directed Graphs with Arbitrary Weights; APSP on Dense Undirected Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)) (hist | edit) [427 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{3} \log^{3} \log V / \log^{2} V)$ == Space Complexity == $O(V^{2})$ words (Derived: Dividing $A$ and $B$ into $V \times q$ and $q \times V$ matrices, in total using $O(V^2)$ space ) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2009 == Reference == http://tmc.web.engr.illinois.edu/moreapsp.pdf")
- 10:38, 15 February 2023 Chan (Geometrically Weighted) (APSP on Geometrically Weighted Graphs All-Pairs Shortest Paths (APSP)) (hist | edit) [354 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{2.{84}4})$ == Space Complexity == $O(l V^{2})$ words (Derived: Compute and store $2l$ $V \times V$ matrices) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2009 == Reference == http://tmc.web.engr.illinois.edu/moreapsp.pdf")
- 10:38, 15 February 2023 Thorup (APSP on Dense Undirected Graphs with Positive Integer Weights; APSP on Sparse Undirected Graphs with Positive Integer Weights All-Pairs Shortest Paths (APSP)) (hist | edit) [407 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(EV)$ == Space Complexity == $O(EV)$ words (https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.22.7128&rep=rep1&type=pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1999 == Reference == http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.22.7128&rep=rep1&type=pdf")
- 10:38, 15 February 2023 Pettie & Ramachandran (APSP on Dense Undirected Graphs with Arbitrary Weights; APSP on Sparse Undirected Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)) (hist | edit) [295 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(EV \log \alpha(E,V))$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Pointer Machine == Year == 2002 == Reference == https://dl.acm.org/citation.cfm?id=545417")
- 10:38, 15 February 2023 Williams (APSP on Dense Directed Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)) (hist | edit) [492 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{3} /{2}^{(\log V)^{0.5}})$ == Space Complexity == $O(V^{2})$ words (Derived: discussed with Ryan, uses an auxiliary $V \times V$ matrix, and the space required for the matrix multiplication of $V \times d$ and $d \times V$ matrices is also $O(V^2)$) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2014 == Reference == https://dl.acm.org/citati...")
- 10:38, 15 February 2023 Seidel's algorithm (APSP on Dense Undirected Unweighted Graphs; APSP on Sparse Undirected Unweighted Graphs All-Pairs Shortest Paths (APSP)) (hist | edit) [379 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O (V^{2.{37}3} \log V)$ == Space Complexity == $O(V^{2})$ words (Derived: Uses four auxiliary $V \times V$ matrices) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1995 == Reference == https://www.sciencedirect.com/science/article/pii/S0022000085710781?via%3Dihub")
- 10:37, 15 February 2023 Floyd–Warshall algorithm (APSP All-Pairs Shortest Paths (APSP)) (hist | edit) [357 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{3})$ == Space Complexity == $O(V^{2})$ words (Derived: Uses a $V \times V$ matrix to store and calculate distances) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1962 == Reference == https://dl.acm.org/citation.cfm?id=368168")
- 10:37, 15 February 2023 Shimbel Algorithm (APSP on Dense Directed Graphs with Arbitrary Weights All-Pairs Shortest Paths (APSP)) (hist | edit) [368 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{4})$ == Space Complexity == $O(V^{2})$ words (Derived: Uses a $V \times V$ matrix to store and calculate distances) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1953 == Reference == https://link.springer.com/article/10.1007/BF02476438")
- 10:37, 15 February 2023 Thorup's algorithm (Nonnegative Integer Weights Shortest Path (Directed Graphs)) (hist | edit) [397 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(E + V min(log log V, log log L))$ == Space Complexity == $O(V)$? ("linear-space queue") words (https://dl.acm.org/doi/10.1016/j.jcss.2004.04.003) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 2004 == Reference == https://dl.acm.org/doi/10.1016/j.jcss.2004.04.003")
- 10:37, 15 February 2023 Gabow Ahuja Algorithm (Nonnegative Integer Weights Shortest Path (Directed Graphs)) (hist | edit) [356 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(E + V*((log(L))^{0.5}) )$ == Space Complexity == $O(m + log C)$ words (https://dl.acm.org/doi/10.1145/77600.77615) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1990 == Reference == https://dl.acm.org/doi/10.1145/77600.77615")
- 10:37, 15 February 2023 Gabow's algorithm (Nonnegative Weights Shortest Path (Directed Graphs)) (hist | edit) [345 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(E logL/log({2}+(E/V)))$ == Space Complexity == $O(V+E)$? words ((keeping track of new graphs?)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1983 == Reference == https://ieeexplore.ieee.org/document/4568085")
- 10:37, 15 February 2023 Dijkstra's algorithm with Fibonacci heap (Johnson 1981; Karlsson & Poblete 1983) (Nonnegative Integer Weights Shortest Path (Directed Graphs)) (hist | edit) [408 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(E log log L)$ == Space Complexity == $O(V+L)$ words (https://www.sciencedirect.com/science/article/pii/0166218X8390104X?via%3Dihub) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1981 == Reference == https://www.sciencedirect.com/science/article/pii/0166218X8390104X?via%3Dihub")
- 10:37, 15 February 2023 Dijkstra's algorithm with Fibonacci heap (Fredman & Tarjan 1984; Fredman & Tarjan 1987) (Nonnegative Weights Shortest Path (Directed Graphs)) (hist | edit) [409 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(E + V log V)$ == Space Complexity == $O(V)$ auxiliary words (keeping track of distances/previous node in path, along with heap) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1984 == Reference == https://www.cs.princeton.edu/courses/archive/fall03/cs528/handouts/fibonacci%20heaps.pdf")
- 10:37, 15 February 2023 Dijkstra's algorithm with binary heap (Johnson 1977) (Nonnegative Weights Shortest Path (Directed Graphs)) (hist | edit) [364 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O((E + V) log V)$ == Space Complexity == $O(V)$ auxiliary words (keeping track of distances/previous node in path, along with heap) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1977 == Reference == https://dl.acm.org/citation.cfm?id=321993")
- 10:37, 15 February 2023 Dijkstra's algorithm with list (Whiting & Hillier 1960) (Nonnegative Weights Shortest Path (Directed Graphs)) (hist | edit) [379 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O( V² )$ == Space Complexity == $O(V)$ auxiliary words (keeping track of distances/previous node in path, along with list) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1960 == Reference == https://www.jstor.org/stable/3007178?seq=1#page_scan_tab_contents")
- 10:37, 15 February 2023 Bellman–Ford algorithm (Dantzig 1960) (Nonnegative Weights Shortest Path (Directed Graphs)) (hist | edit) [329 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O( V² logV)$ == Space Complexity == $O(E)$ (total) words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1960 == Reference == https://www.jstor.org/stable/pdf/2627005.pdf")
- 10:37, 15 February 2023 Bellman–Ford algorithm (Shimbel 1955; Bellman 1958; Moore 1959) (general weights Shortest Path (Directed Graphs)) (hist | edit) [371 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(VE)$ == Space Complexity == $O(V)$ auxiliary words (keeping track of distances) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1959 == Reference == https://www.ams.org/journals/qam/1958-16-01/S0033-569X-1958-0102435-2/S0033-569X-1958-0102435-2.pdf")
- 10:37, 15 February 2023 Bellman–Ford algorithm (Ford 1956) (general weights Shortest Path (Directed Graphs)) (hist | edit) [371 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O( V² EL)$ == Space Complexity == $O(E)$ words (number of equations in LP; each equation has a constant number of variables) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1956 == Reference == https://apps.dtic.mil/sti/pdfs/AD0422842.pdf")
- 10:37, 15 February 2023 Dyer (2-dimensional array representation Closest Pair Problem) (hist | edit) [432 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n)$ using $O(n^{2})$ processors == Space Complexity == $O(n^{2})$ words (https://www.sciencedirect.com/science/article/pii/0020019080900356) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == log-space pyramid cellular automaton == Year == 1980 == Reference == https://www.sciencedirect.com/science/article/pii/0020019080900356")
- 10:37, 15 February 2023 Shamos; Hoey (2-dimensional space, Euclidean metric Closest Pair Problem) (hist | edit) [326 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n logn)$ == Space Complexity == $O(n)$ words (Voronoi diagrams require O(n) space) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1975 == Reference == https://ieeexplore.ieee.org/document/4567872")
- 10:37, 15 February 2023 Hinrichs; Nievergelt; Schorn (2-dimensional space, l m (or l infty) norm Closest Pair Problem) (hist | edit) [379 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(n logn)$ == Space Complexity == $O(n)$ words (https://www.sciencedirect.com/science/article/pii/0020019088901500) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1988 == Reference == https://www.sciencedirect.com/science/article/pii/0020019088901500")
- 10:37, 15 February 2023 Bentley; Shamos (k-dimensional space, l m (or l infty) norm Closest Pair Problem) (hist | edit) [374 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(kn logn)$ == Space Complexity == $O(kn)$? words (keep track of all sorted lists in each dimension; re-use space from recursive calls) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1976 == Reference == https://dl.acm.org/citation.cfm?id=803652")
- 10:37, 15 February 2023 Bentley (k-dimensional space, l m (or l infty) norm Closest Pair Problem) (hist | edit) [374 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(kn logn)$ == Space Complexity == $O(kn)$? words (keep track of all sorted lists in each dimension; re-use space from recursive calls) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1980 == Reference == https://dl.acm.org/citation.cfm?id=358850")
- 10:37, 15 February 2023 Rabin' Algorithm (k-dimensional space, l m (or l infty) norm Closest Pair Problem) (hist | edit) [309 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O({3}^k*n^{2})$ == Space Complexity == $O(n)$ words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == Yes, Las Vegas == Model of Computation == Real RAM == Year == 1976 == Reference == https://dl.acm.org/citation.cfm?id=540196")
- 10:37, 15 February 2023 F. Preparata and M. Shamos (k-dimensional space, l m (or l infty) norm Closest Pair Problem) (hist | edit) [379 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(kn logn)$ == Space Complexity == $O(kn)$? words (keep track of all sorted lists in each dimension; re-use space from recursive calls) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1986 == Reference == https://www.springer.com/gp/book/9780387961316")
- 10:37, 15 February 2023 Fortune and Hopcroft (k-dimensional space, l m (or l infty) norm Closest Pair Problem) (hist | edit) [388 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(kn loglogn+n*{3}^k)$ == Space Complexity == $O(n)$ words (can be easily derived? (can re-use space from recursive calls)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1979 == Reference == https://www.sciencedirect.com/science/article/pii/0020019079900851")
- 10:37, 15 February 2023 Thorup (reverse-delete) (Undirected, General MST Minimum Spanning Tree (MST)) (hist | edit) [375 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(E LogV (loglogV)^{3})$ == Space Complexity == $O(E)$ auxiliary? words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2000 == Reference == https://www.cs.princeton.edu/courses/archive/spr10/cos423/handouts/NearOpt.pdf")
- 10:37, 15 February 2023 Chazelle's algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (hist | edit) [504 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(E*\alpha(E, V))$ == Space Complexity == $O(E)$ auxiliary?? words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2000 == Reference == https://www.cs.princeton.edu/~chazelle/pubs/mst.pdf")
- 10:37, 15 February 2023 Filter Kruskal algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (hist | edit) [424 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(Elog(V))$ == Space Complexity == $O(E)$ auxiliary? words (Kruskal-based, with minimal overhead? filtering should only remove edges, and each edge should only require O(1) information) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2009 == Reference == https://dl.acm.org/citation.cfm?id=2791225")
- 10:37, 15 February 2023 Cheriton-Tarjan Algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (hist | edit) [364 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(EloglogV)$ == Space Complexity == $O(E)$ auxiliary? words (keep track of copy of graph where edges may be deleted?) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1976 == Reference == https://epubs.siam.org/doi/abs/10.1137/0205051")
- 10:37, 15 February 2023 Yao's algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (hist | edit) [350 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(EloglogV)$ == Space Complexity == $O(E)$ auxiliary? words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1975 == Reference == https://www.sciencedirect.com/science/article/pii/0020019075900563")
- 10:37, 15 February 2023 Kruskal's algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (hist | edit) [314 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(ElogE)$ == Space Complexity == $O(E)$ auxiliary words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1956 == Reference == https://www.jstor.org/stable/2033241")
- 10:37, 15 February 2023 Prim's algorithm + Fibonacci heaps; Fredman & Tarjan (Undirected, General MST Minimum Spanning Tree (MST)) (hist | edit) [323 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(E + VlogV)$ == Space Complexity == $O(V)$ auxiliary? words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1987 == Reference == https://dl.acm.org/citation.cfm?id=28874")
- 10:37, 15 February 2023 Prim's algorithm + adjacency matrix searching (Undirected, General MST Minimum Spanning Tree (MST)) (hist | edit) [319 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(V^{2})$ == Space Complexity == $O(V)$ auxiliary words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1957 == Reference == https://ieeexplore.ieee.org/document/6773228")
- 10:37, 15 February 2023 Borůvka's algorithm (Undirected, General MST Minimum Spanning Tree (MST)) (hist | edit) [279 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(ElogV)$ == Space Complexity == $O(V)$ auxiliary words (can be easily derived) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1926 == Reference == -")
- 10:37, 15 February 2023 Hong’s algorithm (SCCs Strongly Connected Components) (hist | edit) [335 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(V(V+E))$ == Space Complexity == $O(V+E)$? words (Building recursive subgraphs) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2013 == Reference == https://stanford-ppl.github.io/website/papers/sc13-hong.pdf")
- 10:37, 15 February 2023 CH Algorithm (SCCs Strongly Connected Components) (hist | edit) [423 bytes] Admin (talk | contribs) (Created page with "== Time Complexity == $O(VE)$ == Space Complexity == $O(V+E)$? words (Each vertex needs to keep track of one color; then we need to build recursive subgraphs) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2004 == Reference == https://research.vu.nl/en/publications/on-distributed-verification-and-verified-distribution")