An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs

A comparison of three algorithms for fin

A comparison of three algorithms for finding fundamental cycles in a directed graph

✍ Doris R. Ryan; Stephen Chen 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 543 KB

## Abstract Given a connected directed graph and a spanning tree, we consider the problem of finding the set of fundamental cycles. In particular, for each cotree arc __i__ and tree arc __j__, we need to know whether or not __i__ and __j__ are in the same fundamental cycle, and if so, whether or no