Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

96

Voted

SODA
2010
ACM

290views Algorithms» more SODA 2010»

Rumour spreading and graph conductance

16 years 28 days ago

Rumour spreading and graph conductance

Download lightless.org

Flavio Chierichetti, Silvio Lattanzi, Alessandro P

Real-time Traffic

Discrete Algorithms | Graph Conductance | SODA 2010 |

claim paper

Related Content

» Theory of Rumour Spreading in Complex Social Networks

» Almost tight bounds for rumour spreading with conductance

» Transaction Level Modelling A reflection on what TLM is and how TLMs may be classified

» Finding trendsetters in information networks

» Computing separable functions via gossip

Post Info
More Details (n/a)

Added	01 Mar 2010
Updated	02 Mar 2010
Type	Conference
Year	2010
Where	SODA
Authors	Flavio Chierichetti, Silvio Lattanzi, Alessandro Panconesi

Comments (0)