Hamiltonicity in random directed graphs is born resilient.

Richard Montgomery

Published in: Comb. Probab. Comput. (2020)

Keyphrases

directed graph
random walk
undirected graph
directed acyclic graph
maximum flow
databases
graph structure
strongly connected
disjoint paths
randomly generated
neural network
optimal solution
digital content