• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

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

Qiang WangHao JiangYing JiangShuwen YiLixia LiCong-Cong XingJun Huang
Published in: IEEE Trans. Netw. Sci. Eng. (2022)
Keyphrases
  • shortest path
  • scale free networks
  • geodesic distance
  • shortest path algorithm
  • complex networks
  • path length
  • betweenness centrality
  • weighted graph
  • travel time