The following pages link to (Q4012000):
Displaying 13 items.
- Optimal stopping in a search for a vertex with full degree in a random graph (Q765377) (← links)
- The best choice problem for upward directed graphs (Q1926501) (← links)
- Gusein-Zade problem for directed path (Q1952502) (← links)
- The best-choice problem for partially ordered objects. (Q1969766) (← links)
- Counting embeddings of rooted trees into families of rooted trees (Q2088692) (← links)
- The best choice problem for a union of two linear orders with common maximum (Q2446902) (← links)
- Counting embeddings of a chain into a tree (Q2566143) (← links)
- (Q4369123) (← links)
- Constructing a strict total order for alternatives characterized by multiple criteria: An extension (Q4632827) (← 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)
- The best choice problem for posets; colored complete binary trees (Q5963606) (← links)
- Optimal stopping for many connected components in a graph (Q6074658) (← links)