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

Gutemberg Guerra‐Filho; Hanan Samet

doi:10.1007/978-3-642-32316-4_4

ScienceGate Book Chapters

BOOK-CHAPTER

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

Gutemberg Guerra‐Filho Hanan Samet

Year: 2012 Advances in geographic information science Pages: 45-59 Publisher: Springer Nature

DOI: 10.1007/978-3-642-32316-4_4

Get Full-Text PDF Get Analytical Report

Keywords:

Shortest path problem K shortest path routing Path (computing) Average path length Yen's algorithm Shortest Path Faster Algorithm Combinatorics Mathematics Distance Computer science Constant (computer programming) Algorithm Dijkstra's algorithm Graph

Metrics

Cited By

0.00

FWCI (Field Weighted Citation Impact)

Refs

0.24

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Topics

Data Management and Algorithms

Physical Sciences → Computer Science → Signal Processing

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

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

Metrics

Topics

Related Documents

Shortest-Path Queries in Geometric Networks

Shortest-path queries for complex networks

Shortest-path queries on complex networks

An Approximation Algorithm for Shortest Path Based on the Hierarchical Networks

Shortest path and distance queries on road networks