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 ...

We consider the bipartite matching model of customers and servers introduced by Caldentey, Kaplan and Weiss (2009). Customers and servers play symmetrical roles.There are finite sets C and S 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 ...

A signed bipartite graph G(U,V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident ...