Back to Results
First PageMeta Content
Tree decomposition / Graph / Trapezoid graph / Koorde / Graph theory / Theoretical computer science / Mathematics


A Doubling Dimension Threshold Θ(log log n) for Augmented Graph Navigability? Pierre Fraigniaud1?? , Emmanuelle Lebhar2 ???
Add to Reading List

Document Date: 2007-01-17 10:04:35

Open Document

File Size: 338,76 KB

Share Result on Facebook

City

Orsay / Paris / /

Company

Distributed Computing Systems / MIT Press / /

Country

France / Netherlands / /

/

IndustryTerm

extent real networks / oblivious routing protocol / navigable networks / non oblivious routing protocol / augmented networks / /

Organization

Ecole Normale Sup´erieure de Lyon / MIT / /

Position

model / summing over the dimensions / /

PublishedMedium

Theoretical Computer Science / /

Technology

oblivious routing protocol / non oblivious routing protocol / peer-to-peer / decentralized algorithm / /

SocialTag