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

Citations

Publications citing this paper.
Showing 1-10 of 30 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Combinatorial Optimization: Networks and matroids

  • E. L. Lawler
  • New York, NY: Holt, Rinehart and Winston,
  • 1976
Highly Influential
6 Excerpts

On two dimensional data organization II

  • W. Lipski, E. Lodi, F. Luccio, C. Mugnai, L. Pagli
  • Fundamenta Informaticae 2, 227-243
  • 1977
2 Excerpts

Similar Papers

Loading similar papers…