Document is current

Any future updates will be listed below

Incremental maintenance of all-pairs shortest paths in relational DBMSs

Crossref DOI link: https://doi.org/10.1007/s13278-017-0457-y

Published Online: 2017-08-01

Published Print: 2017-12

Update policy: https://doi.org/10.1007/springer_crossmark_policy

About CrossMark