Workshop · Nov 17–19, 2026
Seminar, Hosted by University of Birmingham Theoretical Computer Science Seminar
Space-Efficient Hierholzer
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
- Eulerian cycles, search World Wide
- Hierholzer’s algorithm, search World Wide
- directed multigraphs, search World Wide
- undirected multigraphs, search World Wide
- linear running time, broader topic: time
- working storage, broader topic: storage
- vertex count, search World Wide
- dense graphs, broader topic: graphs
- parallel edges, broader topic: edges