3 papers
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…
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…
math.CO2025
Kneser graphs are Hamiltonian
Arturo Merino, Torsten Mütze, Namrata
For integers and , the Kneser graph has as vertices all -element subsets of an -element ground set, and an edge between any two disjoint sets.…