Show simple item record

dc.contributor.advisorKodres, Uno R.
dc.contributor.authorCochrane, John Mackay
dc.dateJune 1970
dc.date.accessioned2012-11-01T22:55:28Z
dc.date.available2012-11-01T22:55:28Z
dc.date.issued1970-06
dc.identifier.urihttp://hdl.handle.net/10945/15117
dc.description.abstractAn algorithm is stated for finding the simple cycles in a digraph which is believed to be superior to previous algorithms. The algorithm is stated in a way which lends itself to use on a digital computer. Suitable modifications are presented which allow the algorithm to be applied to coalesced graphs. Finally, the algorithm is compared to a previously used technique, and is shown to require fewer operations.en_US
dc.description.urihttp://archive.org/details/onlocatingsimple00coch
dc.language.isoen_US
dc.publisherNaval Postgraduate Schoolen_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.en_US
dc.subject.lcshMathematicsen_US
dc.titleOn locating the simple cycles in a digraphen_US
dc.typeThesisen_US
dc.contributor.corporateNaval Postgraduate School (U.S.)
dc.contributor.departmentDepartment of Mathematics
dc.subject.authorDirected graphsen_US
dc.subject.authorCycle locating algorithmsen_US
dc.description.serviceLieutenant (Junior Grade), United States Navyen_US
etd.thesisdegree.nameM.S. in Mathematicsen_US
etd.thesisdegree.levelMastersen_US
etd.thesisdegree.disciplineMathematicsen_US
etd.thesisdegree.grantorNaval Postgraduate Schoolen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record