%0 Journal Article %1 journals/complexity/YangLWH19 %A Yang, Yajun %A Li, Zhongfei %A Wang, Xin %A Hu, Qinghua %D 2019 %J Complex. %K dblp %P 8728245:1-8728245:13 %T Finding the Shortest Path with Vertex Constraint over Large Graphs. %U http://dblp.uni-trier.de/db/journals/complexity/complexity2019.html#YangLWH19 %V 2019

@article{journals/complexity/YangLWH19, added-at = {2020-09-24T00:00:00.000+0200}, author = {Yang, Yajun and Li, Zhongfei and Wang, Xin and Hu, Qinghua}, biburl = {https://www.bibsonomy.org/bibtex/2c81528124f8c022310319ffb880aac7d/dblp}, ee = {https://doi.org/10.1155/2019/8728245}, interhash = {0df0f08a665d4013eb7b44e613fa6710}, intrahash = {c81528124f8c022310319ffb880aac7d}, journal = {Complex.}, keywords = {dblp}, pages = {8728245:1-8728245:13}, timestamp = {2020-09-25T12:01:30.000+0200}, title = {Finding the Shortest Path with Vertex Constraint over Large Graphs.}, url = {http://dblp.uni-trier.de/db/journals/complexity/complexity2019.html#YangLWH19}, volume = 2019, year = 2019 }