1 citations · 2 across the 5 of their papers we have counts for
6 papers
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…
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…
On the Hardness of Gray Code Problems for Combinatorial Objects
Arturo Merino, Namrata, Aaron Williams
Can a list of binary strings be ordered so that consecutive strings differ in a single bit? Can a list of permutations be ordered so that consecutive permutations differ by a swap?…
Hamiltonicity of Schrijver graphs and stable Kneser graphs
Torsten Mütze, Namrata
For integers and , the Schrijver graph has as vertices all -element subsets of that contain no two cyclically adjacent ele…
Combinatorial generation via permutation languages. VI. Binary trees
Petr Gregor, Torsten Mütze, Namrata
In this paper we propose a notion of pattern avoidance in binary trees that generalizes the avoidance of contiguous tree patterns studied by Rowland and non-contiguous tree pattern…
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.…