38 citations · 117 across the 10 of their papers we have counts for
7 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…
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…
Algorithmic Aspects of a General Modular Decomposition Theory
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy +1
A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not res…
Unifying two Graph Decompositions with Modular Decomposition
Binh-Minh Bui-Xuan, Michel Habib, Vincent Limouzy +1
We introduces the umodules, a generalisation of the notion of graph module. The theory we develop captures among others undirected graphs, tournaments, digraphs, and structures…