An Approximation Algorithm for Shortest Path Based on the Hierarchical Networks

Mensah Dennis Nii Ayeh; Hui Gao; Duanbing Chen

doi:10.1007/978-3-319-63645-0_53

ScienceGate Book Chapters

BOOK-CHAPTER

An Approximation Algorithm for Shortest Path Based on the Hierarchical Networks

Mensah Dennis Nii Ayeh Hui Gao Duanbing Chen

Year: 2017 Smart innovation, systems and technologies Pages: 461-472 Publisher: Springer Nature

DOI: 10.1007/978-3-319-63645-0_53

Get Full-Text PDF Get Analytical Report

Keywords:

Shortest path problem Computer science Hierarchical network model K shortest path routing Average path length Algorithm Path (computing) Complex network Evolving networks Dijkstra's algorithm Floyd–Warshall algorithm Theoretical computer science Computer network Graph World Wide Web

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.37

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Complex Network Analysis Techniques

Physical Sciences → Physics and Astronomy → Statistical and Nonlinear Physics

Caching and Content Delivery

Physical Sciences → Computer Science → Computer Networks and Communications

Internet Traffic Analysis and Secure E-voting

Physical Sciences → Computer Science → Artificial Intelligence

An Approximation Algorithm for Shortest Path Based on the Hierarchical Networks

Metrics

Topics

Related Documents

Approximation Algorithm for Shortest Path in Large Social Networks

Group based Shortest Path Routing Algorithm for Hierarchical Cross Connected Recursive Networks (HCCR)

The Shortest Path Algorithm Based on Hierarchical Road Network

A shortest path algorithm based on hierarchical graph model

A Hybrid Shortest Path Algorithm for Intra-Regional Queries on Hierarchical Networks