Graph matching and edit distance algorithms form a cornerstone of modern computational techniques used to quantify the similarity between structured data. These methods underpin a wide array of ...
Online bipartite matching (OBM) has a rich history in the literature of online algorithms, where it has been an influential problem inspiring many algorithms and techniques. This problem of obtaining ...
On the 27th of September 2024, M.Sc. Juha Harvainen defends his PhD thesis on Advances in Sampling and Counting Bipartite Matchings and Directed Acyclic Graphs. The thesis is related to research done ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results