C such that f(C”) = f‘(C”) and f(M’) = f’(M’). , f is a bijection) since H has the minimum number of source sets by assumption.
Analysis and Design of Algorithms for Combinatorial Problems by G. Ausiello
by Richard
4.1
Rated
5 –
based on
votes
of