Survival time of a random graph

DOI10.1007/BF02124675zbMath0707.05054WikidataQ57401612 ScholiaQ57401612MaRDI QIDQ918994

Alan M. Frieze

Publication date: 1989

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

random graphoptimal stopping timesk-connectivity

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items (1)

The Metropolis algorithm for graph bisection

Cites Work

• On the strength of connectedness of a random graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Survival time of a random graph