Title of article :
A simple a.s. correct algorithm for deciding if a graph has a perfect matching
Author/Authors :
Mar?a Rosa Brito، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1995
Abstract :
A fast algorithm for deciding whether a graph of even order has a perfect matching is given. This algorithm has very low probability of error even in the case of graphs with no perfect matching and no isolated points.
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
