-
1Conference
Authors: Giakkoupis, George, Schabanel, Nicolas
Contributors: Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Ducourthial, Bertrand et Felber, Pascal
Source: 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)
https://hal.science/hal-00587955
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France. 4 pSubject Terms: small worlds, social networks, peer-to-peer networks, decentralized search, optimal paths, \category{F.2.2}{Nonnumerical Algorithms and Problems}{Routing and layout} \category{E.1}{Data Structures}{Graphs and networks} \category{G.2.2}{Graph Theory}{Graph algorithms, Network problems} \category{C.2.2}{Network Protocols}{Routing protocols}, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [SHS.SOCIO]Humanities and Social Sciences/Sociology
Subject Geographic: Cap Estérel, France
-
2Conference
Authors: Giakkoupis, George, Schabanel, Nicolas
Contributors: Laboratoire d'informatique Algorithmique : Fondements et Applications (LIAFA), Université Paris Diderot - Paris 7 (UPD7)-Centre National de la Recherche Scientifique (CNRS), Ducourthial, Bertrand et Felber, Pascal
Source: 13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel)
https://hal.archives-ouvertes.fr/hal-00587955
13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France. 4 pSubject Terms: small worlds, social networks, peer-to-peer networks, decentralized search, optimal paths, \category{F.2.2}{Nonnumerical Algorithms and Problems}{Routing and layout} \category{E.1}{Data Structures}{Graphs and networks} \category{G.2.2}{Graph Theory}{Graph algorithms, Network problems} \category{C.2.2}{Network Protocols}{Routing protocols}, [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS], [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation, [INFO.INFO-IR]Computer Science [cs]/Information Retrieval [cs.IR], [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI], [SHS.SOCIO]Humanities and Social Sciences/Sociology
Subject Geographic: Cap Estérel, France
Relation: hal-00587955; https://hal.archives-ouvertes.fr/hal-00587955; https://hal.archives-ouvertes.fr/hal-00587955/document; https://hal.archives-ouvertes.fr/hal-00587955/file/2011.02.11-SW.pdf
-
3Academic Journal
Authors: Aleksandrs Slivkins
Contributors: The Pennsylvania State University CiteSeerX Archives
Subject Terms: ACM Categories and Subject Descriptors. E.1 [Data Structures, Distributed data structures, Graphs and networks, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems – Computations on discrete structures, Routing and layout, G.2 [Discrete Mathematics, G.2.1 Combinatorics – Combinatorial algorithms, G.2.2 Graph Theory – Graph algorithms, Graph labeling, Network problems. C.2.2 [Computer- Communication Networks, Network Protocols – Routing protocols. ACM General Terms. Algorithms, Performance, Theory Keywords. Routing schemes, multi-cast trees, distance labeling, triangulation, grid dimension, growthconstrained metrics, locality-awareness
File Description: application/pdf
Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.1460; http://research.microsoft.com/users/slivkins/podc07_full.pdf