Computing the Point-to-Point Shortest Path: Quotient Space Theory's Application in Complex Network.


https://doi.org/10.1007/978-3-642-16248-0_101
@inproceedings{DBLP:conf/rskt/HeZZZ10, author = {Fu{-}gui He and Yanping Zhang and Shu Zhao and Ling Zhang}, editor = {Jian Yu and Salvatore Greco and Pawan Lingras and Guoyin Wang and Andrzej Skowron}, title = {Computing the Point-to-Point Shortest Path: Quotient Space Theory's Application in Complex Network}, booktitle = {Rough Set and Knowledge Technology - 5th International Conference, {RSKT} 2010, Beijing, China, October 15-17, 2010. Proceedings}, series = {Lecture Notes in Computer Science}, volume = {6401}, pages = {751--758}, publisher = {Springer}, year = {2010}, url = {https://doi.org/10.1007/978-3-642-16248-0\_101}, doi = {10.1007/978-3-642-16248-0\_101}, timestamp = {Mon, 16 Mar 2020 17:44:10 +0100}, biburl = {https://dblp.org/rec/conf/rskt/HeZZZ10.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