mirage

Parcourir LIP - Laboratoire de l'Informatique du Parallélisme par l'auteur "Lebhar, Emmanuelle"

Système d'archivage DSpace/Manakin

Parcourir LIP - Laboratoire de l'Informatique du Parallélisme par l'auteur "Lebhar, Emmanuelle"

Tri par : Ordre : Résultats :

  • Laboratoire de l'informatique du parallélisme; Duchon, Philippe; Hanusse, Nicolas; Lebhar, Emmanuelle; Schabanel, Nicolas (2004-12)
    (eng) In addition to statistical graph properties (diameter, degree, clustering, ...), Kleinberg showed in 2000 that a small-world can also be seen as a graph in which the routing task can be efficiently and easily done. ...
  • Fraigniaud, Pierre; Lebhar, Emmanuelle; Lotker, Zvi; Laboratoire de l'informatique du parallélisme (LIP, 2006-02)
    In his seminal work, Klein leinberg showed how to augment meshes using randoom edges, so that they become navigable; that is, greedy routing computes paths of polylogarithmic expected length between any pairs of nodes. ...
  • Fraigniaud, Pierre; Lebhar, Emmanuelle; Lotker, Zvi; Laboratoire de l'informatique du parallélisme (LIP, 2006-04)
    (eng) In his seminal work, Kleinberg showed how to augment meshes using random edges, so that they become navigable; that is, greedy routing computes paths of polylogarithmic expected length between any pairs of nodes. ...
  • Duchon, Philippe; Hanusse, Nicolas; Lebhar, Emmanuelle; Schabanel, Nicolas; Laboratoire de l'informatique du parallélisme (LIP, 2006-01)
    (eng) We investigate the problem of efficiently preprocessing a large network, in a fully distributed manner, so that the resulting network is a navigable small world. Namely, if the network has bounded growth, by adding ...
  • Laboratoire de l'informatique du parallélisme; Habib, Michel; Kelly, David; Lebhar, Emmanuelle; Paul, Christophe (2003-04)
    (eng) A graph $G_s=(V,E_s)$ is a sandwich for a pair of graph $G_t=(V,E_t)$ and $G=(V,E)$ if $E_t\subseteq E_s\subseteq E$. Any poset, or partially ordered set, admits a unique graph representation which is directed and ...
  • Laboratoire de l'informatique du parallélisme; Lebhar, Emmanuelle; Schabanel, Nicolas (2003-11)
    (eng) Since Milgram experiment in 1967, that demonstrated the ability of people to find short paths efficiently in networks, based only on their own local view of the network, different models have been proposed to study ...

Recherche


Recherche avancée

Parcourir

Mon compte

Bookmark and Share