By Topic

Computational aspects of the Mobius transformation of graphs

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
$33 $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)
Kennes, R. ; IRIDIA, Univ. Libre de Bruxelles, Belgium

Mobius transformations are defined and studied in the framework of general binary relations. From the application point of view fast Mobius transformation algorithms are presented for computing the Mobius transformation of the Boolean lattice. It is proved that they are actually the best algorithms among a large class of algorithms. These algorithms have a polynomial routine, whereas the usual algorithms have an exponential routine. From a theoretical point of view, the major point of the study is the functoriality of the Mobius transformation, which implies that it is recursive. An algorithm for computing Dempster's rule of combination that is much faster than the usual one is obtained. A series of related fast algorithms for Dempster-Shafer theory is included

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:22 ,  Issue: 2 )