Abstract
The algorithm for determining the set of maximum compatibles of Sinha Roy and Sheng is compared with the more recent algorithm of Stoffers. A refinement of the former algorithm is given and a minor mistake in the latter is pointed out.

This publication has 0 references indexed in Scilit: