@Phdthesis{bloemen:strong,
  author = {Vincent Bloemen},
  title = {Strong Connectivity and Shortest Paths for Checking Models},
  school = {University of Twente},
  year = {2019},
  address = {Enschede, The Netherlands},
  url = {https://ris.utwente.nl/ws/portalfiles/portal/122499728/thesis.pdf},
}

@Incollection{dijkstra:finding,
  author = {Edsger W. Dijkstra},
  title = {Finding the Maximum Strong Components in a Directed Graph},
  booktitle = {Selected Writings in Computing: A Personal Perspective},
  series = {Texts and Monographs in Computer Science},
  publisher = {Springer},
  year = {1982},
  pages = {22-30},
}

@article{lammich:gabow,
  author  = {Peter Lammich},
  title   = {Verified Efficient Implementation of Gabow's Strongly Connected Components Algorithm},
  journal = {Archive of Formal Proofs},
  month   = {May},
  year    = {2014},
  note    = {\url{https://isa-afp.org/entries/Gabow_SCC.html},
            Formal proof development},
  ISSN    = {2150-914x},
}

@Article{munro:efficient,
  author = {{J. Ian} Munro},
  title = {Efficient Determination of the Transitive Closure of a Directed Graph},
  journal = {Information Processing Letters},
  volume = 1,
  number = 2,
  pages = {56-58},
  year = 1971,
}

@Article{tarjan:depth-first,
  author = 	 {Robert Tarjan},
  title = 	 {Depth first search and linear graph algorithms},
  journal = 	 {SIAM Journal on Computing},
  year = 	 {1972},
}
