Highly Influenced

# Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems

@article{Lipski1981EfficientAF, title={Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems}, author={Witold Lipski and Franco P. Preparata}, journal={Acta Informatica}, year={1981}, volume={15}, pages={329-346} }

- Published 1981 in Acta Informatica
DOI:10.1007/BF00264533

A bipartite graph G=(A, B, E) is convex on the vertex set A if A can be ordered so that for each element b in the vertex set B the elements of A connected to b form an interval of A; G is doubly convex if it is convex on both A and B. Letting ¦A¦=m and ¦B¦=n, in this paper we describe maximum matching algorithms which run in time O(m + nA(n)) on convex graphs (where A(n) is a very slowly growing function related to a functional inverse of Ackermann's function), and in time O(m+n) on doubly… CONTINUE READING