Comment on a computing the k shortest paths in a graph

Authors:
Eugene L. Lawler
Affiliations:
Univ of California, Berkeley, Berkeley
Venue:
Communications of the ACM
Year:
1977

Citing 2
Cited 1

More on kth shortest paths

Communications of the ACM
On computing sets of shortest paths in a graph

Communications of the ACM

Better k-best parsing

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

Quantified Score

Hi-index	48.22

Visualization

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.