𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Probabilistic verification of Herman’s self-stabilisation algorithm

✍ Scribed by Kwiatkowska, Marta; Norman, Gethin; Parker, David

Book ID
113020187
Publisher
Springer
Year
2012
Tongue
English
Weight
864 KB
Volume
24
Category
Article
ISSN
0934-5043

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A new probabilistic analysis of Karger's
A new probabilistic analysis of Karger's randomized algorithm for minimum cut problems
✍ Yang Dai; Kazuo Iwano; Naoki Katoh 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 556 KB

Recently Karger proposed a new randomized algorithm for finding a minimum cut of an n-vertex graph (weighted or unweighted) with probability fi (a-'). In this paper we present a new probabilistic analysis of Karger's randomized algorithm for a few classes of unweighted graphs. For random graphs whos