Computing Shortest Paths in Networks Derived from Recurrence Relations

E.L. Lawler

EECS Department
University of California, Berkeley
Technical Report No. UCB/ERL M91/7
1991

---

BibTeX citation:

@techreport{Lawler:M91/7,
    Author = {Lawler, E.L.},
    Title = {Computing Shortest Paths in Networks Derived from Recurrence Relations},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1991},
    URL = {http://www.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://www.eecs.berkeley.edu/Pubs/TechRpts/1991/1687.html
%F Lawler:M91/7

---

Home

|      © UC Berkeley EECS

|      Oct 11, 2012 11:22

|      Contact Webteam