"Correctness of a Set-based Algorithm for Computing Strongly Connected ..."

Stephan Merz, Vincent Trélat (2022)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2022-12-12

- view
  - electronic edition @ isa-afp.org (open access)
- export record
  dblp key:
  - journals/afp/MerzT22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/afp/MerzT22
Stephan Merz, Vincent Trélat:
Correctness of a Set-based Algorithm for Computing Strongly Connected Components of a Graph. Arch. Formal Proofs 2022 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.