Back to Results
First PageMeta Content
Algebraic graph theory / Probability theory / Network flow / Network theory / Conductance / Flow network / Connectivity / Graph / Centrality / Graph theory / Mathematics / Theoretical computer science


FAST INFORMATION SPREADING IN GRAPHS WITH LARGE WEAK CONDUCTANCE∗ KEREN CENSOR-HILLEL† AND HADAS SHACHNAI‡ Abstract. Gathering data from nodes in a network is at the heart of many distributed applications, most not
Add to Reading List

Document Date: 2013-04-16 11:33:02


Open Document

File Size: 346,80 KB

Share Result on Facebook

City

Haifa / /

Country

Israel / /

/

IndustryTerm

uniform randomized algorithm / distributed computing / hybrid algorithm / wireless sensor networks / Information spreading algorithms / social networks / linear network / asynchronous networks / distributed applications / information spreading algorithm / sparse mobile networks / /

Organization

Israel Academy of Sciences and Humanities / National Science Foundation / Israel Science Foundation / Department of Computer Science / Technion / /

Person

Bt / /

/

Position

author / quasirandom model for information spreading / synchronous push/pull model of communication / /

Technology

8 K. CENSOR-HILLEL AND H. SHACHNAI Algorithm / Information spreading algorithms / Av / uniform randomized algorithm / hybrid algorithm / information spreading algorithm / /

SocialTag