On locating the simple cycles in a digraph
Cochrane, John Mackay
Kodres, Uno R.
MetadataShow full item record
An 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.
Showing items related by title, author, creator and subject.
Efficient Nonlinear Transient Dynamic Analysis for Structural Optimization Using an Exact Integral Equation Formulation Gordis, Joshua H.; Neta, Beny (Monterey, California. Naval Postgraduate School, 1999-05); NPS-ME-99-009This report serves to document progress made to date on the National Science Foundation Project #97-13481, Earthquake Hazard Mitigation Program. The focus of this phase of the project is the development of an improved ...
A proposed architecture for communication planning in support of Marine Air Ground Task Force operations Woodward, John A. (Monterey, California. Naval Postgraduate School, 1989);The author uses a systems approach methodology to address the requirements for a Marine Air Ground Task Force communication planner. An architecture is developed in which line of sight and beyond line of sight computer ...
Fountanas, Leonidas (Monterey, California. Naval Postgraduate School, 2001-12);This thesis develops active queue management mechanisms for real-time traffic for MANETs. Providing QoS for real-time applications is still an open issue as stated in RFC 2309. The proposed packet-dropping algorithm called ...