Let N be a finite set and T a nonempty subset of N. The paper proposes an algorithm to find the smallest committee containing T. This algorithm is a modification of a previous one proposed by {\it L. J. Billera} [J. Comb. Theory B 11, 234-245 (1971; Zbl 0219.90068)].
Reviewer:
R.Lucchetti
Start
Contact
Print
General Help
