32 citations
- Institut national de recherche en sciences et technologies du numériqueFR11 papers
- Geometric (India)IN3 papers
- Orange (France)FR3 papers
- Centre National de la Recherche ScientifiqueFR2 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR2 papers
- Laboratoire de Mathématiques de VersaillesFR2 papers
- Laboratoire d'Informatique Algorithmique: Fondements et ApplicationsFR2 papers
- Nantes UniversitéFR2 papers
- Association for Symbolic LogicUS1 paper
- Ben-Gurion University of the NegevIL1 paper
- CEA Paris-SaclayFR1 paper
- Center for Responsible TravelUS1 paper
Showing 2006Show all
3 papers · 1 filter
cs.NI2006★ 32 cited
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…
math.CO2006
A Hybrid of Darboux's Method and Singularity Analysis in Combinatorial Asymptotics
Philippe Flajolet, Eric Fusy, Xavier Gourdon +2
A ``hybrid method'', dedicated to asymptotic coefficient extraction in combinatorial generating functions, is presented, which combines Darboux's method and singularity analysis th…
cs.DM2006★ 3 cited
On Covering a Graph Optimally with Induced Subgraphs
Shripad Thite
We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number of vertices in each subgraph is minimized. We prove NP-completeness…