𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Correctness proof for the majority consensus algorithm

✍ Scribed by A. Ravichandran; R.K. Shyamasundar

Book ID
107766479
Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
781 KB
Volume
38
Category
Article
ISSN
0020-0255

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A simplified correctness proof for a wel
A simplified correctness proof for a well-known algorithm computing strongly connected components
✍ Ingo Wegener πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 44 KB

The computation of the strongly connected components of a directed graph is one of the fundamental algorithmic graph problems. Linear-time algorithms with simple implementations are known. Here a simplified correctness proof for one of these algorithms is presented.