A Conjecture on random bipartite matching

  • Parisi G
N/ACitations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

In this note we put forward a conjecture on the average optimal length for bipartite matching with a finite number of elements where the different lengths are independent one from the others and have an exponential distribution.

Cite

CITATION STYLE

APA

Parisi, G. (1998). A Conjecture on random bipartite matching. Retrieved from http://arxiv.org/abs/cond-mat/9801176

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free