Random directed graphs are robustly Hamiltonian.

Dan Hefetz Angelika Steger Benny Sudakov

Published in: Random Struct. Algorithms (2016)

Keyphrases

directed graph
random walk
directed acyclic graph
maximum flow
strongly connected
graph structure
directed edges
neural network
undirected graph
information retrieval
lower bound
state space
relational data
randomly generated
uniformly distributed
disjoint paths