PPT-3.2.1. Augmenting path algorithm
Two theorems to recall Theorem 3110 Berge A matching M in a graph G is a maximum matching in G iff G has no M augmenting path Theorem 3116 KönigEgerváry If
Download Presentation
"3.2.1. Augmenting path algorithm" is the property of its rightful owner. Permission is granted to download and print materials on this website for personal, non-commercial use only, provided you retain all copyright notices. By downloading content from our website, you accept the terms of this agreement.
Presentation Transcript
Transcript not available.