Cart (Loading....) | Create Account
Close category search window
 

On the Equivalence of Two Algorithms for Finding All Maximal Compatibles

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

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.

Published in:

Computers, IEEE Transactions on  (Volume:C-24 ,  Issue: 10 )

Date of Publication:

Oct. 1975

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.