Practical Algorithms for the All-Pairs Shortest Path Problem

Andrej Brodnik; Marko Grgurovič

doi:10.1007/978-3-319-77510-4_6

ScienceGate Book Chapters

BOOK-CHAPTER

Practical Algorithms for the All-Pairs Shortest Path Problem

Andrej Brodnik Marko Grgurovič

Year: 2018 Emergence, complexity and computation Pages: 163-180 Publisher: Springer Nature

DOI: 10.1007/978-3-319-77510-4_6

Get Full-Text PDF Get Analytical Report

Keywords:

K shortest path routing Bottleneck Shortest path problem Floyd–Warshall algorithm Shortest Path Faster Algorithm Transitive closure Algorithm Yen's algorithm Longest path problem Computer science Path (computing) Constrained Shortest Path First Mathematics Theoretical computer science Dijkstra's algorithm Combinatorics Graph

Metrics

Cited By

1.01

FWCI (Field Weighted Citation Impact)

Refs

0.73

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Complexity and Algorithms in Graphs

Physical Sciences → Computer Science → Computational Theory and Mathematics

Data Management and Algorithms

Physical Sciences → Computer Science → Signal Processing

Optimization and Search Problems

Physical Sciences → Computer Science → Computer Networks and Communications

Practical Algorithms for the All-Pairs Shortest Path Problem

Metrics

Citation History

Topics

Related Documents

Subcubic Cost Algorithms for the All Pairs Shortest Path Problem

Sub-cubic cost algorithms for the all pairs shortest path problem

Scalability of parallel algorithms for the all-pairs shortest-path problem

On the all-pairs-shortest-path problem

Algorithms of All Pair Shortest Path Problem