Back to Results
First PageMeta Content
Network flow / Tree decomposition / Shortest path problem / Flow network / Differential geometry / Product rule / Integration by parts / Graph theory / Mathematics / Theoretical computer science


On the Searchability of Small-World Networks ∗ with Arbitrary Underlying Structure Pierre Fraigniaud George Giakkoupis
Add to Reading List

Document Date: 2010-04-12 08:36:01


Open Document

File Size: 372,56 KB

Share Result on Facebook

City

Cambridge / Paris / /

Company

Small-World Networks / /

Country

France / United States / /

Currency

pence / USD / /

/

Event

Product Issues / Product Recall / /

IndustryTerm

decentralized search / search process / long-range contact networks / decentralized search algorithms / greedy search / polylogarithmic search performance / search path / to search algorithms / decentralized search algorithm / search makes / n-node network / non-greedy decentralized search algorithms / greedy search algorithm takes / natural search algorithm / search paths / social networks / social network / search moves / search algorithm / polylogarithmic search / search algorithms / search subproblems / greedy search algorithm / /

Organization

Congress / National Academy of Sciences / /

Person

Bt / Kleinberg / S. Milgram / /

Position

mathematical model / model / mathematical graph model / sociologist / /

Product

Augmentation scheme / /

ProvinceOrState

Massachusetts / /

PublishedMedium

Psychology Today / Theory of Computing / /

Technology

Graph algorithms / search algorithm / decentralized algorithm / search algorithms / P2P / ESA / non-greedy decentralized search algorithms / decentralized search algorithms / decentralized search algorithm / 2.2 Search algorithm / natural search algorithm / greedy search algorithm / /

SocialTag