Perfect Matching and Reachability Problem in Graphs
No Thumbnail Available
URL
Journal Title
Journal ISSN
Volume Title
Perustieteiden korkeakoulu |
Bachelor's thesis
Electronic archive copy is available locally at the Harald Herlin Learning Centre. The staff of Aalto University has access to the electronic bachelor's theses by logging into Aaltodoc with their personal Aalto user ID. Read more about the availability of the bachelor's theses.
Authors
Date
2021-12-17
Department
Major/Subject
Tietotekniikka
Mcode
SCI3027
Degree programme
Teknistieteellinen kandidaattiohjelma
Language
en
Pages
23
Series
Description
Supervisor
Hyvönen, EeroThesis advisor
Gupta, ChetanKeywords
complexity theory, perfect matching, directed reachability, isolation lemma, graph theory