Fleury's algorithm + Thorup (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph): Difference between revisions
Jump to navigation
Jump to search
(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") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(E log^{3}(E)$ | $O(E \log^{3}(E)$ \log\log E) | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 10:30, 28 April 2023
Time Complexity
$O(E \log^{3}(E)$ \log\log E)
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