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

A search strategy for the elementary cycles of a directed graph

โœ Scribed by Jayme L. Szwarcfiter; Peter E. Lauer

Publisher
Springer Netherlands
Year
1976
Tongue
English
Weight
951 KB
Volume
16
Category
Article
ISSN
0006-3835

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Partition of a directed bipartite graph
Partition of a directed bipartite graph into two directed cycles
โœ Hong Wang; Charles Little; Kee Teo ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 356 KB

Let D = (V1, V2; A) be a directed bipartite graph with II/11 = 11/21 = n ~> 2. Suppose that do(x) + do(y) >~ 3n + 1 for all xe I/1 and ye V2. Then D contains two vertex-disjoint directed cycles of lengths 2nl and 2n2, respectively, for any positive integer partition n = n~ + n2. Moreover, the condit

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

On the cycle polytope of a directed grap
On the cycle polytope of a directed graph
โœ Egon Balas; Maarten Oosten ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 185 KB ๐Ÿ‘ 2 views