Thèse, Algorithme et structure de données, Computer Science, Data Structures and Algorithms

Reachability problems for general rotor walks in graphs

Loric Duhaze-Pradines. Reachability problems for general rotor walks in graphs. Computer Science and Game Theory [cs.GT]. Université Paris-Saclay, 2023. English. ⟨NNT : 2023UPASG051⟩. ⟨tel-04504876⟩

Published on