E.L. Lawler

EECS Department, University of California, Berkeley

Technical Report No. UCB/ERL M91/7

, 1991

http://www2.eecs.berkeley.edu/Pubs/TechRpts/1991/ERL-91-7.pdf

---

BibTeX citation:

@techreport{Lawler:M91/7,
    Author= {Lawler, E.L.},
    Title= {Computing Shortest Paths in Networks Derived from Recurrence Relations},
    Year= {1991},
    Month= {Jan},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1991/1687.html},
    Number= {UCB/ERL M91/7},
}

EndNote citation:

%0 Report
%A Lawler, E.L. 
%T Computing Shortest Paths in Networks Derived from Recurrence Relations
%I EECS Department, University of California, Berkeley
%D 1991
%@ UCB/ERL M91/7
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1991/1687.html
%F Lawler:M91/7