Space-Efficient Hierholzer for Undirected Graphs

Elena Grigorescu, Ziad Ismaili Alaoui, Tamio-Vesa Nakajima +2

We present a simple linear-time algorithm that outputs an Eulerian tour of an undirected multigraph with $n$ vertices and $m$ edges, if one exists, in $O(m)$ time and using $O(n)$…