An optimal algorithm to find the degrees of connectedness in an undirected edge-weighted graph

Authors:
Saibal Banerjee
Affiliations:
-
Venue:
Pattern Recognition Letters
Year:
1991

Citing 4
Cited 2

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
Algorithmics: theory & practice

Algorithmics: theory & practice
An algorithm to compute the supremum of max-min powers and a property of fuzzy graphs

Pattern Recognition Letters
The fuzzy geometry of image subsets

Pattern Recognition Letters

Types of arcs in a fuzzy graph

Information Sciences: an International Journal
Node connectivity and arc connectivity of a fuzzy graph

Information Sciences: an International Journal

Quantified Score

Hi-index	0.10

Visualization

Abstract

Given an undirected graph on n vertices, whose edges are weighted by non-negative real numbers, the degree of connectedness between two distinct vertices is a concept of fundamental importance in the study of undirected fuzzy graphs and symmetrical fuzzy relations. In this paper we obtain an optimal O(n^2) algorithm that finds the degree of connectedness between all pairs of distinct vertices in the graph. It is further shown that the running time of this algorithm is output sensitive.