Matching in graphs is a subset of edges with no shared endpoints. and a maximum matching is a matching of maximum size among all matchings in a given graph.
PathsTreesAndFlowers.pdf
PathsTreesAndFlowers.tex'thoughts > Computer Science' 카테고리의 다른 글
| Ternary Search (0) | 2008.11.24 |
|---|---|
| External Path Length (3) | 2008.10.14 |
