1995-01-19
1998-11-24
Jankus, Almis R.
G06T 1100
Patent
active
058419586
ABSTRACT:
A computer technique for bipartite matching of objects of one subset with objects of a different subset where multiple choices are permitted. A bipartite graph is formed in which the objects form nodes and the edges connecting pairs of nodes represent costs of matching the nodes connected. The original tour or graph is decomposed into a plurality of quasi-convex subtours or subgraphs and the minimum cost match of each subtour is found and the union of all such matches of the subtours is used as the desired match.
REFERENCES:
patent: 5481668 (1996-01-01), Marcus
Buss Samuel R.
Yianilos Peter N.
Feig Philip J.
Jankus Almis R.
NEC Research Institute Inc.
The Regents of the University of California
Torsiglieri Arthur J.
LandOfFree
Bipartite matching does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Bipartite matching, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bipartite matching will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-1712612