Optimal stopping in a search for a vertex with full degree in a random graph.

Michal Przykucki

Published in: Discret. Appl. Math. (2012)

Keyphrases

random graphs
optimal stopping
undirected graph
graph theoretic
search algorithm
search space
brownian motion
phase transition
social network analysis
finite horizon