23 citations · 61 across the 7 of their papers we have counts for
Showing cs.SIShow all
2 papers · 1 filter
cs.SI2016★ 5 cited
Greedy Routing and the Algorithmic Small-World Phenomenom
Karl Bringmann, Ralph Keusch, Johannes Lengler +2
The algorithmic small-world phenomenon, empirically established by Milgram's letter forwarding experiments from the 60s, was theoretically explained by Kleinberg in 2000. However,…
cs.SI2015
Sampling Geometric Inhomogeneous Random Graphs in Linear Time
Karl Bringmann, Ralph Keusch, Johannes Lengler
Real-world networks, like social networks or the internet infrastructure, have structural properties such as large clustering coefficients that can best be described in terms of an…