Holistic Top-k Simple Shortest Path Join in Graphs.


https://doi.org/10.1109/TKDE.2011.117
@article{DBLP:journals/tkde/GaoYQJWY12, author = {Jun Gao and Jeffrey Xu Yu and Huida Qiu and Xiao Jiang and Tengjiao Wang and Dongqing Yang}, title = {Holistic Top-k Simple Shortest Path Join in Graphs}, journal = {{IEEE} Trans. Knowl. Data Eng.}, volume = {24}, number = {4}, pages = {665--677}, year = {2012}, url = {https://doi.org/10.1109/TKDE.2011.117}, doi = {10.1109/TKDE.2011.117}, timestamp = {Sat, 20 May 2017 00:24:22 +0200}, biburl = {https://dblp.org/rec/journals/tkde/GaoYQJWY12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }

本页面没有标签
本页面最近更新:2020/05/21更新历史
发现错误?想一起完善? 在 GitHub 上编辑此页!
本页面的全部内容在 CC BY-SA 4.0 SATA 协议之条款下提供,附加条款亦可能应用

Copyright © 2016 - 2020 PKU Scholar

最近更新: 52aade4, 2020-05-21