Found 1 document(s)
Page 1 of 1
-
A matching on a finite graph G = (V,E) is a collection of pairwise nonadjacent edges M in E....
Discover Books. Explore Knowledge.