Edge-disjoint cycles in regular directed graphs.

Noga Alon Colin McDiarmid Michael Molloy

Published in: J. Graph Theory (1996)

Keyphrases

directed graph
edge disjoint
spanning tree
total length
undirected graph
random walk
graph structure
directed acyclic graph
graph structures
strongly connected
minimum cost
data sets
running times
social networks
artificial intelligence
maximum flow
disjoint paths
machine learning