Document is current

Any future updates will be listed below

I/O-efficient algorithms for top-k nearest keyword search in massive graphs

Crossref DOI link: https://doi.org/10.1007/s00778-017-0464-7

Published Online: 2017-05-29

Published Print: 2017-08

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

About CrossMark