On finding the k shortest paths in RDF data

Filtz, Erwin and Savenkov, Vadim and Umbrich, Jürgen (2016) On finding the k shortest paths in RDF data. Proceedings of Intelligent Exploration of Semantic Data. ISSN 1613-0073

[img]
Preview
Text
IESD_2016_final.pdf

Download (327kB) | Preview
Item Type: Article
Divisions: Departments > Informationsverarbeitung u Prozessmanag. > Informationswirtschaft
Version of the Document: Published
Variance from Published Version: Not applicable
Depositing User: Erwin Filtz
Date Deposited: 11 Feb 2020 10:15
Last Modified: 11 Feb 2020 10:15
URI: https://epub.wu.ac.at/id/eprint/7476

Actions

View Item View Item

Downloads

Downloads per month over past year

View more statistics