Pages that link to "Item:Q4684858"
From MaRDI portal
The following pages link to Percolation and best-choice problem for powers of paths (Q4684858):
Displaying 5 items.
- Counting embeddings of rooted trees into families of rooted trees (Q2088692) (← links)
- Secretary problem with hidden information; searching for a high merit candidate (Q2111202) (← links)
- Maximizing the expected number of components in an online search of a graph (Q2237242) (← links)
- An optimal algorithm for stopping on the element closest to the center of an interval (Q2665754) (← links)
- Optimal stopping for many connected components in a graph (Q6074658) (← links)
