Back to Results
First PageMeta Content
Graph operations / Tree decomposition / Connectivity / NP-complete problems / Network flow / Graph theory / Theoretical computer science / Mathematics


Polylogarithmic Network Navigability Using Compact Metrics with Small Stretch Pierre Fraigniaud∗ Cyril Gavoille†
Add to Reading List

Document Date: 2008-04-15 13:07:10

Open Document

File Size: 145,08 KB

Share Result on Facebook

City

Madrid / Munich / /

Company

Randomized P2P Networks / M. Katz N. A. / ComputerCommunication Networks / Navigable Augmented Networks / Computer-Communication Networks / /

Country

Germany / /

Currency

pence / USD / /

/

Facility

University Paris Diderot France University of Bordeaux / /

IndustryTerm

n-node network / oblivious routing protocol / long-range contact networks / social networks / real world networks / arbitrary networks / decentralized search algorithm / constant size algorithm / /

Organization

Small Stretch Pierre Fraigniaud∗ Cyril Gavoille† CNRS and University Paris Diderot France University / International Congress / /

Position

Model / Analysis / inframetric model for the internet / /

PublishedMedium

Theoretical Computer Science / Psychology Today / Theory of Computing / /

Technology

oblivious routing protocol / ESA / routing protocol / decentralized search algorithm / constant size algorithm / peer-to-peer / Network Protocols / /

URL

http /

SocialTag