MCQOPTIONS
Saved Bookmarks
| 1. |
A matching that matches all the vertices of a graph is called? |
| A. | Perfect matching |
| B. | Cardinality matching |
| C. | Good matching |
| D. | Simplex matching |
| Answer» B. Cardinality matching | |