Fleury's algorithm + Thorup (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph): Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

28 April 2023

15 February 2023

  • curprev 12:1512:15, 15 February 2023‎ Admin talk contribs‎ 404 bytes +404‎ Created page with "== Time Complexity == $O(E log^{3}(E)$ loglogE) == Space Complexity == $O(E)$ words (Keep track of current path + remaining edges needed to be traversed) == 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"
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Fleury%27s_algorithm_%2B_Thorup_(Constructing_Eulerian_Trails_in_a_Graph_Constructing_Eulerian_Trails_in_a_Graph)"