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 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 ...
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 ...
In this paper, we study the spectral radius of bipartite graphs. Let 𝐺 be a bipartite graph with 𝑒 edges without isolated vertices. It was known that the spectral radius of 𝐺 is at most the square ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback