On computing sets of shortest paths in a graph

Authors:
Edward Minieka
Affiliations:
Univ. of Illinois, Chicago
Venue:
Communications of the ACM
Year:
1974

Citing 4
Cited 4

A Method for the Solution of the Nth Best Path Problem

Journal of the ACM (JACM)
Algorithm 97: Shortest path

Communications of the ACM
Graphs and Hypergraphs

Graphs and Hypergraphs
Introduction to Mathematical Machine Theory

Introduction to Mathematical Machine Theory

Reducing the effects of infeasible paths in branch testing

TAV3 Proceedings of the ACM SIGSOFT '89 third symposium on Software testing, analysis, and verification
Comment on a computing the k shortest paths in a graph

Communications of the ACM
More on kth shortest paths

Communications of the ACM
Better k-best parsing

Parsing '05 Proceedings of the Ninth International Workshop on Parsing Technology

Quantified Score

Hi-index	48.25

Visualization

Abstract

Two algorithms are presented that construct the k shortest paths between every pair of vertices in a directed graph. These algorithms generalize the Floyd algorithm and the Dantzig algorithm for finding the shortest path between every pair of vertices in a directed graph.