38 citations · 83 across the 5 of their papers we have counts for
5 papers
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…
Stratification in P2P Networks - Application to BitTorrent
Anh-Tuan Gai, Fabien Mathieu, Julien Reynier +1
We introduce a model for decentralized networks with collaborating peers. The model is based on the stable matching theory which is applied to systems with a global ranking utility…
On Using Matching Theory to Understand P2P Network Design
Dmitry Lebedev, Fabien Mathieu, Laurent Viennot +3
This paper aims to provide insight into stability of collaboration choices in P2P networks. We study networks where exchanges between nodes are driven by the desire to receive the…