Comparing Two Algorithms for Finding Maximal Matchings in Bipartite Graphs

Jong, R.G. (Rachel) de

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.

Bachelor Informatica

The following thesis was written by a student in the 2018-2019 class of the Bachelor Informatica programme at Leiden University.

Thesis details

Title	Comparing Two Algorithms for Finding Maximal Matchings in Bipartite Graphs
Student	Jong, R.G. (Rachel) de
Programme	Bachelor Informatica
Year	2018-2019
Supervisors	Laarman, dr. A.W. (Alfons) L. Vinkhuijzen, MSc (second supervisor)
Thesis	Open Thesis PDF

Citation details

Jong, R.G. (Rachel) de, Comparing Two Algorithms for Finding Maximal Matchings in Bipartite Graphs, Thesis Bachelor Informatica, LIACS, Leiden University, 2019.