38 citations · 117 across the 10 of their papers we have counts for
11 papers
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…
Maximum Biclique for Star 1,2,3 -free and Bounded Bimodularwidth Twin-free Bipartite Graphs
Fabien de Montgolfier, Renaud Torfs
There are three usual definitions of a maximum bipartite clique (biclique) in a bipartite graph\,: either maximizing the number of vertices, or of edges, or finding a maximum balan…
Scalable Distributed Video-on-Demand: Theoretical Bounds and Practical Algorithms
Laurent Viennot, Yacine Boufkhad, Fabien Mathieu +2
We analyze a distributed system where n nodes called boxes store a large set of videos and collaborate to serve simultaneously n videos or less. We explore under which conditions s…
A Note On Computing Set Overlap Classes
Pierre Charbit, Michel Habib, Vincent Limouzy +3
Let be a finite set of elements and a family of subsets of Two sets and of overlap if $X_i \…
Acyclic Preference Systems in P2P Networks
Anh-Tuan Gai, Dmitry Lebedev, Fabien Mathieu +3
In this work we study preference systems natural for the Peer-to-Peer paradigm. Most of them fall in three categories: global, symmetric and complementary. All these systems share…
NLC-2 graph recognition and isomorphism
Vincent Limouzy, Fabien De Montgolfier, Michaël Rao
NLC-width is a variant of clique-width with many application in graph algorithmic. This paper is devoted to graphs of NLC-width two. After giving new structural properties of the c…