The following thesis was written by a student who graduated in 2006 from the Master Computer Science programme at Leiden University.


Thesis details

TitleTowards an Automatic Derivation of Tarjan's Algorithm for Detecting Strongly Connected Components in Directed Graphs
StudentSpek, H. (Harmen) van der
ProgrammeMaster Computer Science
Year2006
SupervisorsWijshoff, prof.dr. H.A.G. (Harry)
Bakker, dr. E.M. (Erwin)

Citation details

Spek, H. (Harmen) van der, Towards an Automatic Derivation of Tarjan's Algorithm for Detecting Strongly Connected Components in Directed Graphs, Thesis Master Computer Science, LIACS, Leiden University, 2006.