3 papers
cs.DS2025
Space-Efficient Hierholzer: Eulerian Cycles in Time and Space
Ziad Ismaili Alaoui, Detlef Plump, Sebastian Wild
We describe a simple variant of Hierholzer's algorithm that finds an Eulerian cycle in a (multi)graph with vertices and edges using bits of working me…
cs.DS2025
Succinct Preferential Attachment Graphs
Ziad Ismaili Alaoui, Namrata, Sebastian Wild
Computing over compressed data combines the space saving of data compression with efficient support for queries directly on the compressed representation. Such data structures are…
cs.DS2024
Simple approximation algorithms for Polyamorous Scheduling
Yuriy Biktairov, Leszek Gąsieniec, Wanchote Po Jiamjitrak +3
In Polyamorous Scheduling, we are given an edge-weighted graph and must find a periodic schedule of matchings in this graph which minimizes the maximal weighted waiting time betwee…