This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
August 1975 (vol. 24 no. 8)
pp. 838-840
F. Handoko, IBM SDD Laboratory
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.
Index Terms:
Compatibility, decomposition, lexicographic order, maximum compatibles (MC's).
Citation:
F. Handoko, "A Discussion on Two Algorithms for Determining Maximum Compatibles," IEEE Transactions on Computers, vol. 24, no. 8, pp. 838-840, Aug. 1975, doi:10.1109/T-C.1975.224318
Usage of this product signifies your acceptance of the Terms of Use.