Computational aspects of the Mobius transformation of graphs

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