Login / Signup

Efficient Batched Distance, Closeness and Betweenness Centrality Computation in Unweighted and Weighted Graphs.

Manuel ThenStephan GünnemannAlfons KemperThomas Neumann
Published in: Datenbank-Spektrum (2017)
Keyphrases
  • weighted graph
  • betweenness centrality
  • edge weights
  • distance measure
  • shortest path
  • graph partitioning
  • information retrieval
  • image processing
  • distance function
  • discrete data