An algorithm to compute the supremum of max-min powers and a property of fuzzy graphs

  • Authors:

  • Prabir Bhattacharya;Francis Suraweera

  • Affiliations:

  • -;-

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 1991

Quantified Score

Hi-index 0.10

Visualization

Abstract

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.