Back to Results
First PageMeta Content
Network theory / Graph connectivity / Connectivity / Cut / Graph / Maximum flow problem / Shortest path problem / Graph theory / Mathematics / Theoretical computer science


Notions of Connectivity in Overlay Networks? Yuval Emek1 , Pierre Fraigniaud2 , Amos Korman2 , Shay Kutten3 , and David Peleg4 1 4
Add to Reading List

Document Date: 2012-04-26 12:04:26


Open Document

File Size: 314,59 KB

Share Result on Facebook

Company

Overlay Networks / /

Country

France / Israel / /

/

Facility

University of Paris Diderot / The Weizmann Institute of Science / /

IndustryTerm

trivial solution / higher level network / layer network / Polynomial time algorithms / traffic network / multi-layer networks / communication network / approximation algorithm / feasible solution / communication networks / polynomial time algorithm / polynomial time logarithmic approximation algorithm / lower level underlying network / /

MusicGroup

U2 / /

Organization

Science and Israel Ministry of Science / CNRS / University of Paris Diderot / France Ministry of Science / Technion / Weizmann Institute of Science / /

Product

M-16 / /

Technology

P2P / SDH / MPLS / polynomial time logarithmic approximation algorithm / Polynomial time algorithms / polynomial time algorithm / approximation algorithm / peer-to-peer / SONET / /

SocialTag