Thumbnail
Access Restriction
Subscribed

Author Weimer, Don L.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract The need to determine minimum paths through a maze very often arises in such fields as traffic, transportation, communication and network studies. Computer analysis of these maze problems has been hampered in many cases due to the excessive size of the network under consideration. A technique has been developed to handle networks of very large magnitude by serially processing the network repetitively until only minimum paths remain.
Description Affiliation: Ohio Department of Highways, Bureau of Data Processing, Columbus (Weimer, Don L.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 6
Issue Number 11
Page Count 3
Starting Page 664
Ending Page 666


Open content in new tab

   Open content in new tab
Source: ACM Digital Library