8 papers
Independent Set Reconfiguration on Threshold Signed Graphs
Ziad Ismaili Alaoui
The Token Jumping and Sliding Token problems are fundamental reconfiguration problems defined on the independent sets of an undirected graph. Given two independent sets and …
Rule-Based Graph Programs Matching the Time Complexity of Imperative Algorithms
Ziad Ismaili Alaoui, Detlef Plump
We report on recent advances in rule-based graph programming, which allow us to match the time complexity of some fundamental imperative graph algorithms. In general, achieving the…
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…
Implementing Binary Search Trees in GP 2 (Extended Abstract)
Ziad Ismaili Alaoui, Detlef Plump
We present an approach to implement binary search trees in the rule-based graph programming language GP 2. Our implementation uses GP 2's rooted graph transformation rules to be fa…
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…
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…