Packing, Counting and Covering Hamilton cycles in random directed graphs.

Asaf Ferber Gal Kronenberg Eoin Long

Published in: Electron. Notes Discret. Math. (2015)

Keyphrases

directed graph
random walk
maximum flow
graph structure
directed acyclic graph
undirected graph
uniformly distributed
strongly connected
disjoint paths
neural network
real world
information retrieval
social networks
randomly generated
packing problem