finds an independent edge set of the graph g with a maximum number of edges.
uses rules vw to specify the graph g.
Details and Options
Examplesopen allclose all
An art history department would like to offer six courses. There are eight professors, each of whom is willing to teach certain courses. Find a maximal matching where professors only teach courses they are interested in teaching:
Properties & Relations (3)
Test whether a set of edges is an independent edge set using IndependentEdgeSetQ: