Correctness of a Set-based Algorithm for Computing Strongly Connected Components of a Graph

Stephan Merz 📧 and Vincent Trélat 📧

August 17, 2022

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

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

License

BSD License

Topics

Session SCC_Bloemen_Sequential

Cite

× 
@article{SCC_Bloemen_Sequential-AFP,
  author  = {Stephan Merz and Vincent Trélat},
  title   = {Correctness of a Set-based Algorithm for Computing Strongly Connected Components of a Graph},
  journal = {Archive of Formal Proofs},
  month   = {August},
  year    = {2022},
  note    = {\url{https://isa-afp.org/entries/SCC_Bloemen_Sequential.html},
             Formal proof development},
  ISSN    = {2150-914x},
}
Download

Download

× Download latest

Older releases: