Pages that link to "Item:Q5470783"
From MaRDI portal
The following pages link to Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case (Q5470783):
Displaying 12 items.
- Optimal stopping in a search for a vertex with full degree in a random graph (Q765377) (← links)
- Partial-order analogue of the secretary problem: The binary tree case (Q1584204) (← links)
- The best choice problem for upward directed graphs (Q1926501) (← links)
- Gusein-Zade problem for directed path (Q1952502) (← links)
- 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 efficient algorithm for stopping on a sink in a directed graph (Q2450610) (← links)
- An optimal algorithm for stopping on the element closest to the center of an interval (Q2665754) (← 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)
- Optimal stopping for many connected components in a graph (Q6074658) (← links)
