On some conditioning results in the probabilistic analysis of algorithms

DOI10.1016/0166-218X(85)90012-5zbMath0574.68057MaRDI QIDQ1063418

Colin J. H. McDiarmid

Publication date: 1985

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

probabilistic analysis of graph algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Linear expected-time algorithms for connectivity problems

This page was built for publication: On some conditioning results in the probabilistic analysis of algorithms