3 papers
cs.DS2026
On the power of standard DFS and BFS
Binh-Minh Bui-Xuan, Michel Habib, Fabien de Montgolfier +1
It is well-known since the seventies of last century that Depth First Search (DFS) can be used to compute strongly connected components [RE. Tarjan. SIAM Journal on Computing, 1972…
cs.DS2026
Model checking with temporal graphs and their derivative
Binh-Minh Bui-Xuan, Florent Krasnopol, Bruno Monasson +1
Temporal graphs are graphs where the presence or properties of their vertices and edges change over time. When time is discrete, a temporal graph can be defined as a sequence of st…
cs.DS2026
The Price of Universal Temporal Reachability
Binh-Minh Bui-Xuan, Nhat-Minh Nguyen, Sébastien Tixeuil +1
Dynamic networks are graphs in which edges are available only at specific time instants, modeling connections that change over time. The dynamic network creation game studies this…