%0 Conference Paper %1 conf/waim/ShanWPJS16 %A Shan, Xiaohuan %A Wang, Xin %A Pang, Jun %A Jiang, Liyan %A Song, Baoyan %B WAIM Workshops %D 2016 %E Song, Shaoxu %E Tong, Yongxin %K dblp %P 239-248 %T A Shortest Path Query Method Based on Tree Decomposition and Label Coverage. %U http://dblp.uni-trier.de/db/conf/waim/waimw2016.html#ShanWPJS16 %V 9998 %@ 978-3-319-47120-4

@inproceedings{conf/waim/ShanWPJS16, added-at = {2019-08-31T00:00:00.000+0200}, author = {Shan, Xiaohuan and Wang, Xin and Pang, Jun and Jiang, Liyan and Song, Baoyan}, biburl = {https://www.bibsonomy.org/bibtex/2d3f82a07e2e2fffeb6015636bb4a80c1/dblp}, booktitle = {WAIM Workshops}, crossref = {conf/waim/2016w}, editor = {Song, Shaoxu and Tong, Yongxin}, ee = {https://doi.org/10.1007/978-3-319-47121-1_20}, interhash = {accfb84db69f86d24e5c29a2dcbca7c0}, intrahash = {d3f82a07e2e2fffeb6015636bb4a80c1}, isbn = {978-3-319-47120-4}, keywords = {dblp}, pages = {239-248}, series = {Lecture Notes in Computer Science}, timestamp = {2019-09-17T12:17:21.000+0200}, title = {A Shortest Path Query Method Based on Tree Decomposition and Label Coverage.}, url = {http://dblp.uni-trier.de/db/conf/waim/waimw2016.html#ShanWPJS16}, volume = 9998, year = 2016 }