Login / Signup

SRank: Shortest paths as distance between nodes of a graph with application to RDF clustering.

Hadi Khosravi FarsaniMohammad Ali NematbakhshGeorg Lausen
Published in: J. Inf. Sci. (2013)
Keyphrases
  • shortest path
  • clustering method
  • shortest path algorithm
  • graph clustering
  • k means
  • road network
  • path length
  • geodesic distance
  • shortest distance
  • social networks
  • distance measure
  • weighted graph