Computing maximum non-crossing matching in convex bipartite graphs

0Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

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=Θ(<sup>n2</sup>) in the worst case, our result improves the previous work.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free