Optimal stopping in a search for a vertex with full degree in a random graph
type: Item
instance of: scholarly article
title: Optimal stopping in a search for a vertex with full degree in a random graph
zbMATH Open document ID: 1237.05191
author: Michał Przykucki
published in: Discrete Applied Mathematics
publication date: 2012-03-19T00:00:00Z
Mathematics Subject Classification ID: 05C80
Mathematics Subject Classification ID: 05C07
zbMATH DE Number: 6015815
zbMATH Keywords: random graph
zbMATH Keywords: vertex with full degree
zbMATH Keywords: optimal stopping
MaRDI profile type: Publication
full work available at URL: j.dam.2011.10.023
OpenAlex ID: W2153656244
cites work: Paths in graphs
cites work: Who solved the secretary problem
cites work: On an optimal stopping problem of Gusein-Zade
cites work: Partially ordered secretaries
cites work: On a universal best choice algorithm for partially ordered sets
cites work: Q4012000
cites work: On a best-choice problem by dependent criteria
cites work: Q5601976
cites work: Graph-Theoretic Generalization of the Secretary Problem: The Directed Path Case
cites work: Dynamic Programming and Decision Theory
cites work: Partial-order analogue of the secretary problem: The binary tree case
cites work: The best-choice problem for partially ordered objects.
cites work: Gusein-Zade problem for directed path
cites work: Q4001778
cites work: Q3921912
DOI: 10.1016/J.DAM.2011.10.023
description: scientific article; zbMATH DE number 6015815