An O(n log n) algorithm for the convex bipartite matching problem

Authors:
G. Gallo
Affiliations:
Dipartimento di Informatica, University of Pisa, 1-56100 Pisa, Italy
Venue:
Operations Research Letters
Year:
1984

Citing 1
Cited 2

Data structures and network algorithms

Data structures and network algorithms

A fast bipartite network flow algorithm for selective assembly

Operations Research Letters
Dynamic matchings in convex bipartite graphs

MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

An efficient algorithm to solve the maximum cardinality matching problem in convex bipartite graphs is presented. In the algorithm use is made of a special data structure based on a binary heap.