Long cycles in subgraphs of (pseudo)random directed graphs.
Ido Ben-EliezerMichael KrivelevichBenny SudakovPublished in: J. Graph Theory (2012)
Keyphrases
- directed graph
- pseudorandom
- graph properties
- graph structures
- uniformly distributed
- random walk
- random numbers
- random number
- secret key
- data structure
- maximum flow
- graph structure
- real time
- undirected graph
- user specific
- directed acyclic graph
- data analysis
- strongly connected
- feature space
- high dimensional
- database systems