Login / Signup
Efficient Batched Distance and Centrality Computation in Unweighted and Weighted Graphs.
Manuel Then
Stephan Günnemann
Alfons Kemper
Thomas Neumann
Published in:
BTW (2017)
Keyphrases
</>
weighted graph
edge weights
distance measure
distance function
graph connectivity
machine learning
social networks
maximum likelihood
shortest path
regularization framework