For some bipartite graphs, we prove that the stability region is indeed maximal for any admissible matching policy. For the ML policy, we prove that the stability region is maximal for any bipartite ...

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

Graph Matching and Edit Distance Algorithms Publication Trend The graph below shows the total number of publications each year in Graph Matching and Edit Distance Algorithms.