"SRank: Shortest paths as distance between nodes of a graph with ..."

Hadi Khosravi Farsani, Mohammad Ali Nematbakhsh, Georg Lausen (2013)

> Home

Details and statistics

DOI: 10.1177/0165551512463994

access: closed

type: Journal Article

metadata version: 2019-06-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jis/FarsaniNL13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jis/FarsaniNL13
Hadi Khosravi Farsani, Mohammad Ali Nematbakhsh, Georg Lausen:
SRank: Shortest paths as distance between nodes of a graph with application to RDF clustering. J. Inf. Sci. 39(2): 198-210 (2013)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.