Journal ArticleOPEN ACCESS

On Computing Sets of Shortest Paths in a Graph

Communications of the ACM (1974) 17(6) 351-353
DOI: 10.1145/355616.364037
18Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

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. © 1974, ACM. All rights reserved.

Author supplied keywords

Cite

CITATION STYLE

APA

Minieka, E. (1974). On Computing Sets of Shortest Paths in a Graph. Communications of the ACM, 17(6), 351–353. https://doi.org/10.1145/355616.364037

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free