241 citations · 602 across the 6 of their papers we have counts for
6 papers
Public Transit Labeling
Daniel Delling, Julian Dibbelt, Thomas Pajor +1
We study the journey planning problem in public transit networks. Developing efficient preprocessing-based speedup techniques for this problem has been challenging: current approac…
Route Planning in Transportation Networks
Hannah Bast, Daniel Delling, Andrew Goldberg +5
We survey recent advances in algorithms for route planning in transportation networks. For road networks, we show that one can compute driving directions in milliseconds or less ev…
Distance-Based Influence in Networks: Computation and Maximization
Edith Cohen, Daniel Delling, Thomas Pajor +1
A premise at a heart of network analysis is that entities in a network derive utilities from their connections. The {\em influence} of a seed set of nodes is defined as the sum…
Computing Classic Closeness Centrality, at Scale
Edith Cohen, Daniel Delling, Thomas Pajor +1
Closeness centrality, first considered by Bavelas (1948), is an importance measure of a node in a network which is based on the distances from the node to all other nodes. The clas…
Sketch-based Influence Maximization and Computation: Scaling up with Guarantees
Edith Cohen, Daniel Delling, Thomas Pajor +1
Propagation of contagion through networks is a fundamental process. It is used to model the spread of information, influence, or a viral infection. Diffusion patterns can be specif…
Maximizing Modularity is hard
U. Brandes, D. Delling, M. Gaertler +4
Several algorithms have been proposed to compute partitions of networks into communities that score high on a graph clustering index called modularity. While publications on these…