AN ALGORITHM TO COMPUTE THE SUPREMUM OF MAX-MIN POWERS AND A PROPERTY OF FUZZY GRAPHS

作     者：BHATTACHARYA, P SURAWEERA, F 

作者机构：GRIFFITH UNIVSCH COMP & INFORMAT TECHNOLNATHANQLD 4111AUSTRALIA 

出 版 物：《PATTERN RECOGNITION LETTERS》 (模式识别快报)

年 卷 期：1991年第12卷第7期

页      面：413-420页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Center for Computer & Information Sciences  University of Nebraska-Lincoln 

主　　题：MAX-MIN PRODUCT POLYNOMIAL-TIME ALGORITHM NP-COMPLETE SPANNING TREE FUZZY PATTERN RECOGNITION FUZZY GRAPH 

摘      要：We obtain a polynomial-time algorithm to compute the supremum of the max-min powers of a map from the Cartesian product of a set to a bounded subset of the real numbers. It is also shown that the value at a pair (x, y) is equal to the maximum of the first k powers of the map where k is the diameter between x and y in a graph corresponding to the map. A characterization is obtained of the metric introduced by Rosenfeld (1975) for a fuzzy graph.