Skip to contentSkip to filters

We use cookies for analytics.

Space-Efficient Hierholzer

Ziad Ismaili Alaoui

University of Liverpool

Abstract

Ziad Ismaili Alaoui gives two variants of Hierholzer’s algorithm for Eulerian cycles, one for directed multigraphs and one for undirected multigraphs. Both keep linear running time while reducing working storage to a number of words proportional to the vertex count. The distinct constructions stream the resulting cycle, a saving especially relevant to dense graphs and graphs with parallel edges.

Topics