On Searching Multiple Disjoint Shortest Paths in Scale-Free Networks With Hyperbolic Geometry-Reference-Cited by-同舟云学术

On Searching Multiple Disjoint Shortest Paths in Scale-Free Networks With Hyperbolic Geometry

Author:

Wang Qiang¹^ORCID,Jiang Hao²^ORCID,Jiang Ying³^ORCID,Yi Shuwen¹^ORCID,Li Lixia⁴,Xing Cong-Cong⁵^ORCID,Huang Jun⁶^ORCID

Affiliation:

1. Electronic Information School, Wuhan University, Wuhan, China

2. Electronic Information School and the Geospatial Information Technology Cooperative Innovation Center, Wuhan University, Wuhan, China

3. School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China

4. Electronic Information School, Wuhan University, and the Wuhan Digital and Engineering Institute, Wuhan, China

5. Department of Mathematics and Computer Science, Nicholls State University, Thibodaux, LA, USA

6. Department of Computer Science, Baylor University, Waco, TX, USA

Funder

National Natural Science Foundation of China

Equipment Project of the Equipment Development Department

Special Funds for Innovation in Scientific Research Program of Zhongshan

Science and Technology Program of Guangzhou

Special Fund for Science and Technology of Guangdong Province

Zhongshan R&D Platform Program

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Computer Networks and Communications,Computer Science Applications,Control and Systems Engineering

Link

Reference71 articles.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献