23 citations · 61 across the 7 of their papers we have counts for
Showing 2016Show all
3 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,…
math.CO2016★ 2 cited
Colorability Saturation Games
Ralph Keusch
We consider the following two-player game: Maxi and Mini start with the empty graph on vertices and take turns, always adding one additional edge to the graph such that the chr…
cs.DM2016★ 23 cited
Average Distance in a General Class of Scale-Free Networks with Underlying Geometry
Karl Bringmann, Ralph Keusch, Johannes Lengler
In Chung-Lu random graphs, a classic model for real-world networks, each vertex is equipped with a weight drawn from a power-law distribution, and two vertices form an edge indepen…