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

Transforming a cyclic directed graph into an acyclic graph

โœ Scribed by V. V. Filippovich

Publisher
Springer US
Year
1975
Tongue
English
Weight
238 KB
Volume
9
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A phase transition phenomenon in a rando
A phase transition phenomenon in a random directed acyclic graph
โœ B. Pittel; R. Tungol ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 158 KB

Let a random directed acyclic graph be defined as being obtained from the random graph G n p by orienting the edges according to the ordering of vertices. Let ฮณ \* n be the size of the largest (reflexive, transitive) closure of a vertex. For p = c log n /n, we prove that, with high probability, ฮณ \*

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