Abstract: The matching problem formulated as Maximum Cardinality Matching in General Graphs (MCMGG) finds the largest matching on graphs without restrictions. The Micali-Vazirani algorithm has the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback