Fleury's algorithm + Thorup (Constructing Eulerian Trails in a Graph Constructing Eulerian Trails in a Graph)
Jump to navigation
Jump to search
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