ON LOCATING THE SIMPLE CYCLES IN A DIGRAPH.

Abstract

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. The algorithm is compared to a previously used technique, and is shown to require fewer operations. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1970
Accession Number
AD0709933

Entities

People

  • John Mackay Cochrane

Organizations

  • Naval Postgraduate School

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computers
  • Digital Computers

Readers

  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design