perfect matching

Show Summary Details

Quick Reference

A term used in graph theory. A matching of a graph is any subset of its edges such that no two members of the subset are adjacent. A perfect matching is a matching in which every vertex of the graph is an end-point of some element of the matching.

Subjects: Computing.

Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.