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

被引：39

作者：

BHATTACHARYA, P ^{[1
]}

SURAWEERA, F ^{[1
]}

机构：

[1] GRIFFITH UNIV,SCH COMP & INFORMAT TECHNOL,NATHAN,QLD 4111,AUSTRALIA

来源：

PATTERN RECOGNITION LETTERS | 1991年 / 12卷 / 07期

关键词：

MAX-MIN PRODUCT; POLYNOMIAL-TIME ALGORITHM; NP-COMPLETE; SPANNING TREE; FUZZY PATTERN RECOGNITION; FUZZY GRAPH;

D O I：

10.1016/0167-8655(91)90307-8

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：413 / 420

页数：8

共 18 条

[1]

Aho A., 1983, DATA STRUCTURES ALGO

[2]

[Anonymous], 1981, PATTERN RECOGN

[3]

BAASE S, 1988, COMPUTER ALGORITHMS

[4]

BHATTACHARYA P, 1988, PATTERN RECOGN, V6, P297

[5]

DEVI BB, 1984, PATTERN RECOGN LETT, V2, P139, DOI 10.1016/0167-8655(84)90037-0

[6] GRAPH THEORETIC ANALYSIS OF PATTERN-CLASSIFICATION VIA TAMURAS FUZZY RELATION [J].

DUNN, JC .

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1974, SMC4 (03) :310-313

[7]

Garey M.R., 1979, COMPUTERS INTRACTABI, V174

[8] SOME APPLICATIONS OF GRAPH THEORY TO CLUSTERING [J].

HUBERT, LJ .

PSYCHOMETRIKA, 1974, 39 (03) :283-309

[9]

Kandel A., 1986, FUZZY MATH TECHNIQUE

[10]

PREDYCZ W, 1990, PATTERN RECOGN, V23, P121

← 1 2 →