A matching in a graph is a collection of edges in the graph such that no node in the graph belongs to more than one edge in the matching. The figure below exhibits examples of matchings (highlighted with red edges) in each of three different graphs.
Wikipedia
Page:
Context:
Rosalind is a platform for learning bioinformatics through problem solving. Please login with Google/Twitter/Facebook or register a new account.
