As shown by Mulmuley, Vazirani and Vazirani, the problem of minimum weight perfect matching is converted to finding minors in the adjacency matrix of a graph. Using the isolation lemma, a minimum weight perfect matching in a graph can be found with probability at least . For a graph with n vertices, it requires time.
As shown by Mulmuley V.azirani and Vazirani, the problem of, minimum weight perfect matching is converted to finding minors in the adjacency matrix of a graph Using the isolation lemma a minimum weight perfect matching in a graph can be found with probability at least . For a graph with n v,e.rtices, it requires time