THEOREM OF THE DAY: Konig’s Bipartite Matching Theorem

In a bipartite graph the cardinality of a minimum cover is equal to the cardinality of a maximum matching.

Κάντε κλικ στην εικόνα.