Pages that link to "Item:Q765377"
From MaRDI portal
The following pages link to Optimal stopping in a search for a vertex with full degree in a random graph (Q765377):
Displayed 4 items.
- The best choice problem for upward directed graphs (Q1926501) (← links)
- Secretary problem with hidden information; searching for a high merit candidate (Q2111202) (← links)
- Percolation and best-choice problem for powers of paths (Q4684858) (← links)
- From Directed Path to Linear Order---The Best Choice Problem for Powers of Directed Path (Q5251623) (← links)