Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Schaik, SJV"'
Publikováno v:
SIGMOD Conference
When answering many reachability queries on a large graph, the principal challenge is to represent the transitive closure of the graph compactly, while still allowing fast membership tests on that transitive closure. Recent attempts to address this p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cde6b087f85e930de6855536a72e51d8
http://ora.ox.ac.uk/objects/uuid:e99c79dc-07b3-49da-b155-08476f57c738
http://ora.ox.ac.uk/objects/uuid:e99c79dc-07b3-49da-b155-08476f57c738
