|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
On the Equivalence of Two Algorithms for Finding All Maximal Compatibles
October 1975 (vol. 24 no. 10)
pp. 977-979
| ASCII Text | x | ||
| null Chao-Chih Yang, "On the Equivalence of Two Algorithms for Finding All Maximal Compatibles," IEEE Transactions on Computers, vol. 24, no. 10, pp. 977-979, October, 1975. | |||
| BibTex | x | ||
| @article{ 10.1109/T-C.1975.224103, author = {null Chao-Chih Yang}, title = {On the Equivalence of Two Algorithms for Finding All Maximal Compatibles}, journal ={IEEE Transactions on Computers}, volume = {24}, number = {10}, issn = {0018-9340}, year = {1975}, pages = {977-979}, doi = {http://doi.ieeecomputersociety.org/10.1109/T-C.1975.224103}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - On the Equivalence of Two Algorithms for Finding All Maximal Compatibles IS - 10 SN - 0018-9340 SP977 EP979 EPD - 977-979 A1 - null Chao-Chih Yang, PY - 1975 KW - Boolean algebra KW - edge-inclusion table KW - incompatibility graph KW - maximal compatible. VL - 24 JA - IEEE Transactions on Computers ER - | |||
This correspondence provides an extended version of the algebraic method using Boolean algebra for deriving all maximal compatibles. It then shows that the algorithm based on the reduction of the edge-inclusion table, with respect to a given incompatibility graph for finding all maximal compatibles, is equivalent to the extended version just mentioned, and that the latter is much simpler.
Index Terms:
Boolean algebra, edge-inclusion table, incompatibility graph, maximal compatible.
Citation:
null Chao-Chih Yang, "On the Equivalence of Two Algorithms for Finding All Maximal Compatibles," IEEE Transactions on Computers, vol. 24, no. 10, pp. 977-979, Oct. 1975, doi:10.1109/T-C.1975.224103
Usage of this product signifies your acceptance of the Terms of Use.

