You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output.
Click here to find out more.
Mendeley readers
| Chapter title |
Modified MinG Algorithm to Find Top-K Shortest Paths from large RDF Graphs
|
|---|---|
| Chapter number | 17 |
| Book title |
Semantic Web Challenges
|
| Published by |
Springer, Cham, May 2016
|
| DOI | 10.1007/978-3-319-46565-4_17 |
| Book ISBNs |
978-3-31-946564-7, 978-3-31-946565-4
|
| Authors |
Zohaib Hassan, Mohammad Abdul Qadir, Muhammad Arshad Islam, Umer Shahzad, Nadeem Akhter |
Mendeley readers
The data shown below were compiled from readership statistics for 4 Mendeley readers of this research output. Click here to see the associated Mendeley record.
Geographical breakdown
| Country | Count | As % |
|---|---|---|
| Unknown | 4 | 100% |
Demographic breakdown
| Readers by professional status | Count | As % |
|---|---|---|
| Professor | 1 | 25% |
| Professor > Associate Professor | 1 | 25% |
| Other | 1 | 25% |
| Student > Master | 1 | 25% |
| Readers by discipline | Count | As % |
|---|---|---|
| Computer Science | 3 | 75% |
| Social Sciences | 1 | 25% |