Filtz, Erwin, Savenkov, Vadim, Umbrich, Jürgen. 2016. On finding the k shortest paths in RDF data. INTELLIGENT EXPLORATION OF SEMANTIC DATA (IESD 2016), Kobe, Japan, 18.10 - 19.10.
BibTeX
Tags
Press 'enter' for creating the tagPublication's profile
| Status of publication | Published |
|---|---|
| Affiliation | WU |
| Type of publication | Paper presented at an academic conference or symposium |
| Language | English |
| Title | On finding the k shortest paths in RDF data |
| Event | INTELLIGENT EXPLORATION OF SEMANTIC DATA (IESD 2016) |
| Year | 2016 |
| Date | 18.10 - 19.10 |
| Country | Japan |
| Location | Kobe |
| URL | http://scim.brad.ac.uk/~dthakker/event/iesd2016/iesd16_submission_7.pdf |
Associations
- Projects
- Graphsense - Realtime Anomaly Detection in Virtual and Non-Virtual Currency Networks
- People
- Filtz, Erwin (Details)
- Savenkov, Vadim (Details)
- Umbrich, Jürgen (Former researcher)
- Organization
- Applied Information Technology (Details)