We consider computing a maximum non-crossing matching in convex bipartite graphs. For a convex bipartite graph of n vertices and m edges, we present an O(nlogn) time algorithm for finding a maximum non-crossing matching in the graph. The previous best algorithm takes O(m+nlogn) time (Malucelli et al., 1993). Since m=Θ(n2) in the worst case, our result improves the previous work.
CITATION STYLE
Chen, D. Z., Liu, X., & Wang, H. (2015). Computing maximum non-crossing matching in convex bipartite graphs. Discrete Applied Mathematics, 187, 50–60. https://doi.org/10.1016/j.dam.2015.02.014
Mendeley helps you to discover research relevant for your work.