Optimal stopping in a search for a vertex with full degree in a random graph
From MaRDI portal
Publication:765377
DOI10.1016/J.DAM.2011.10.023zbMATH Open1237.05191OpenAlexW2153656244MaRDI QIDQ765377FDOQ765377
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.10.023
Recommendations
- Maximizing the expected number of components in an online search of a graph
- Optimal stopping for many connected components in a graph
- Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case
- An efficient algorithm for stopping on a sink in a directed graph
- Gusein-Zade problem for directed path
Cites Work
- Paths in graphs
- Title not available (Why is that?)
- Who solved the secretary problem
- Dynamic Programming and Decision Theory
- On an optimal stopping problem of Gusein-Zade
- Partially ordered secretaries
- On a universal best choice algorithm for partially ordered sets
- Partial-order analogue of the secretary problem: The binary tree case
- Gusein-Zade problem for directed path
- The best-choice problem for partially ordered objects.
- Title not available (Why is that?)
- Title not available (Why is that?)
- On a best-choice problem by dependent criteria
- Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case
- Title not available (Why is that?)
Cited In (7)
- Secretary problem with hidden information; searching for a high merit candidate
- From Directed Path to Linear Order---The Best Choice Problem for Powers of Directed Path
- Percolation and best-choice problem for powers of paths
- The best choice problem for upward directed graphs
- Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case
- Optimal stopping for many connected components in a graph
- On randomized stopping points and perfect graphs
This page was built for publication: Optimal stopping in a search for a vertex with full degree in a random graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765377)
