๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Simplified Convergence Proof for the Cone Partitioning Algorithm

โœ Scribed by Brigitte Jaumard; Christophe Meyer


Book ID
110262120
Publisher
Springer US
Year
1998
Tongue
English
Weight
80 KB
Volume
13
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A simplified correctness proof for a wel
โœ 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.