Bipartite Matching

Institution: University of California, San Diego

Summary
Brief description unavailable

Description
This invention is an algorithm for a graph theoretic approach to matching text strings or images. The invention addresses the problem of efficiently matching strings, with runtimes of N(log N) or, in certain cases, linear with N (where N is the size of the problem to be addressed).