Showing 2026Show all
2 papers · 1 filter
cs.DS2026
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 vertices and edges, if one exists, in time and using …
cs.DS2026
Rooting Out Entropy: Optimal Tree Extraction for Ultra-Succinct Graphs
Ziad Ismaili Alaoui, Tamio-Vesa Nakajima, Namrata +1
We combine two methods for the lossless compression of unlabeled graphs - entropy compressing adjacency lists and computing canonical names for vertices - and solve an ensuing nove…