Eugene L. Lawler
Abstract
In [1] Hardgrave discusses “positional” versus keyword parameter communication with subprograms from the viewpoint of structured programming. In this note an additional argument in favor of the keyword approach is suggested.
- 1 Minieka, E. On computing sets of shortest paths in a graph. Comm. ACM 17 (June 1974), 351-353. Google Scholar
Digital Library
- 2 Dreyfus, S, An appraisal of some shortest-path algorithms. Oper. Res. 17 (1969), 395-412.Google ScholarDigital Library
- 3 Fox, B.L. More on kth shortest paths. Comm. ACM 18, 5 (May 1975), 279. Google ScholarDigital Library
Recommendations
On computing sets of shortest paths in a graph
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 ...
Finding min-sum disjoint shortest paths from a single source to all pairs of destinations
TAMC'06: Proceedings of the Third international conference on Theory and Applications of Models of ComputationGiven a graph G = (V, E) with |V| = n, |E| = m, and a source node s, we consider the problem of finding two disjoint paths from s to two destination nodes t1 and t2 with minimum total length, for every pair nodes t1, t2 ∈ V–{s}. One efficient solution ...
Shortest vertex-disjoint two-face paths in planar graphs
Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G let s1,…,sk be vertices incident with s let t1,…,tk be vertices incident with t. We give an algorithm to compute k pairwise ...
Comments