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

We add a fixed number of vertices of degree 1 to each vertex from one part of a bipartite graph. We study characteristic, matching and some related polynomials for graphs obtained in this way.

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

In an interesting recent article [4], J. W. Moon has given a list of properties of the graph L(Bmn) (to be defined more precisely below) and investigated the question of whether these properties ...

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