68 citations · 128 across the 9 of their papers we have counts for
Showing 2008Show all
2 papers · 1 filter
cs.DS2008★ 45 cited
A Local Clustering Algorithm for Massive Graphs and its Application to Nearly-Linear Time Graph Partitioning
Daniel A. Spielman, Shang-Hua Teng
We study the design of local algorithms for massive graphs. A local algorithm is one that finds a solution containing or near a given vertex without looking at the whole graph. We…
cs.GT2008★ 1 cited
Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget
Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan Rajaraman +2
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players or…