On finding the first link of a fastest path
dc.contributor.author | Kaufman, David E. | en_US |
dc.contributor.author | Smith, Robert L. | en_US |
dc.date.accessioned | 2006-02-03 | |
dc.date.available | 2006-02-03 | |
dc.date.issued | 1995 | en_US |
dc.identifier | UMR4831 | en_US |
dc.identifier.uri | https://hdl.handle.net/2027.42/5911 | |
dc.format.extent | 15 bytes | |
dc.format.extent | 23392 bytes | |
dc.format.extent | 3366 bytes | |
dc.format.extent | 25748 bytes | |
dc.format.extent | 1100838 bytes | |
dc.format.mimetype | text/plain | |
dc.format.mimetype | text/plain | |
dc.format.mimetype | text/plain | |
dc.format.mimetype | text/plain | |
dc.format.mimetype | application/pdf | |
dc.language.iso | en_US | en_US |
dc.subject | Transportation -- Mathematical models. | en_US |
dc.subject | Algorithms. | en_US |
dc.subject | Intelligent Vehicle Highway Systems. | en_US |
dc.title | On finding the first link of a fastest path | en_US |
dc.type | Technical Report | en_US |
dc.subject.hlbtoplevel | Engineering | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/5911/5/bap9086.0001.001.pdf | en_US |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/5911/4/bap9086.0001.001.txt | en_US |
dc.owningcollname | Engineering, College of - Technical Reports |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe its collections in a way that respects the people and communities who create, use, and are represented in them. We encourage you to Contact Us anonymously if you encounter harmful or problematic language in catalog records or finding aids. More information about our policies and practices is available at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.