33 citations · 45 across the 11 of their papers we have counts for
9 papers · 1 filter
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…
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…
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…
Distributed computation of temporal twins in periodic undirected time-varying graphs
Lina Azerouk, Binh-Minh Bui-Xuan, Camille Palisoc +2
Twin nodes in a static network capture the idea of being substitutes for each other for maintaining paths of the same length anywhere in the network. In dynamic networks, we model…
Temporal Matching
Julien Baste, Binh-Minh Bui-Xuan, Antoine Roux
A link stream is a sequence of pairs of the form , where represents a time instant and . Given an integer , the -edge between vertices $…
Fast FPT algorithms for vertex subset and vertex partitioning problems using neighborhood unions
B. -M. Bui-Xuan, J. A. Telle, M. Vatshelle
We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. Boolean-width is similar to rank-width, which is…