A matching (aka **Independent Edge Set**) in a simple graph is the set of pairwise non-adjacent edges i.e. no two edges have common vertex.
A matching (aka Independent Edge Set) in a simple graph is the set of pairwise non-adjacent edges i.e. no two edges have common vertex. The related concepts are maximal matching, maximum matching, perfect or complete matching and near-perfect matching.
|
created |
11 years, 11 months ago |
|
viewed |
8 times |
|
active |
9 years ago |
|
editors |
1 |
