PPT-3.2.1. Augmenting path algorithm
SO
tawny-fly
Published 2015-10-22 | 5494 Views
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
Download Presentation The PPT/PDF document "3.2.1. Augmenting path algorithm" is the property of its rightful owner. Permission is granted to download and print the materials on this website for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.