### 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

- Computer science/Algorithms/Graph

### Session SCC_Bloemen_Sequential

- SCC_Bloemen_Sequential

## Cite

×

SCC_Bloemen_Sequential-AFP

    @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:

- Sep 13, 2023 : Isabelle2023
- Oct 27, 2022 : Isabelle2022
- Sep 9, 2022 : Isabelle2021-1