Protocol, Cryptography, Algorithms, Decentralized Storage.
d-indegree is (n,α,β,d) depth robust graph (DRG) if every subgraph of αn nodes contains a path of length at least βn. DRGs were first introduced by Erd ̋os, Graham, and Szemeredi, who constructed a family of (n,α,β,clogn)-depth robust graphs using extreme constant-degree bipartite expander graphs,