๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Note on a modification of the fundamental cycles finding algorithm

โœ Scribed by Antonije D. Jovanovich

Book ID
113161763
Publisher
Elsevier Science
Year
1974
Tongue
English
Weight
116 KB
Volume
3
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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