Stream: Mirror: Isabelle Users Mailing List

Topic: [isabelle] New in the AFP: Correctness of a Set-Based Alg...

view this post on Zulip Email Gateway (Sep 09 2022 at 08:09):

From: Tobias Nipkow <nipkow@in.tum.de>
Correctness of a Set-Based Algorithm for Computing Strongly Connected Components
of a Graph

Stephan Merz and Vincent Trélat

We prove the correctness of a sequential algorithm for computing maximal
strongly connected components (SCCs) of a graph due to Vincent Bloemen.

https://www.isa-afp.org/entries/SCC_Bloemen_Sequential.html

Enjoy!
smime.p7s

Last updated: Jan 04 2025 at 20:18 UTC