Towards an Automatic Derivation of Tarjan's Algorithm for Detecting Strongly Connected Components in Directed Graphs

Spek, H. (Harmen) van der

LIACS Thesis Repository

These webpages contain theses and reports by students affiliated with the various bachelor and master programmes offered at the Leiden Institute of Advanced Computer Science (LIACS), the computer science and artificial intelligence department of Leiden University.
Note: this thesis repository might be incomplete for certain programmes.

Master Computer Science

The following thesis was written by a student in the 2006 class of the Master Computer Science programme at Leiden University.

Thesis details

Title	Towards an Automatic Derivation of Tarjan's Algorithm for Detecting Strongly Connected Components in Directed Graphs
Student	Spek, H. (Harmen) van der
Programme	Master Computer Science
Year	2006
Supervisors	Wijshoff, 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.