Please enable JavaScript.
Coggle requires JavaScript to display documents.
Hungarian Matching (A matched vertex is one if it is endpoint of an edge…
Hungarian Matching
A matched vertex is one if it is endpoint of an edge in M, where M is the matching graph
Otherwise, that vertex is free
-
-
An alternating tree is a tree rooted at some free vertex 'v' in which every path is an alternating path
-
-
-
-
KM transforms the problem from an optimization problem of finding a max-weight matching into a combinatorial problem of finding a perfect matching
-
-
-
-
