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

From Algorithm Wiki
Revision as of 11:15, 15 February 2023 by Admin (talk | contribs) (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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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/w/index.php?title=Fleury%27s_algorithm_%2B_Thorup_(Constructing_Eulerian_Trails_in_a_Graph_Constructing_Eulerian_Trails_in_a_Graph)&oldid=45315"