A search algorithm for finding the simple cycles of a directed graph
| dc.contributor.author | Johnson, LeRoy | |
| dc.date.accessioned | 2023-03-01T18:30:53Z | |
| dc.date.available | 2023-03-01T18:30:53Z | |
| dc.date.issued | 1974 | |
| dc.description.abstract | Two efficient algorithms, that admit each simple cycle once in searching the ares of a digraph, are presented and a proof of the algorithms provided. The first algorithm is nonadaptive while the second is an adaptive one. Since they extract cycles directly, they require less storage than Weinblatt. Since the method of search of the first is more efficient than Tiernan, it is faster than Tiernan. An example used by Tiernan is given for comparison. The speed is discussed in relation to number of vertices, arcs, and simple cycles. The storage requirement is 0(n). The adaptive version has a theoretical speed bound by O(c.m.n), where c is the number of cycles, m the number of arcs, and n the number of vertices. Both algorithms are bounded by 0(N[subscript c] .m) on the complete graph where Ν[subscript c] is the number of cycles of the complete graph. | |
| dc.description.copyright | Copyright @ LeRoy Johnson, 1974. | |
| dc.identifier.uri | https://unbscholar.lib.unb.ca/handle/1882/15019 | |
| dc.rights | http://purl.org/coar/access_right/c_abf2 | |
| dc.subject.discipline | Computer Science | |
| dc.title | A search algorithm for finding the simple cycles of a directed graph | |
| dc.type | technical report |
Files
Original bundle
1 - 1 of 1