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

Banerjee, S., An optimal algorithm to find the degrees of connectedness in an undirected edge-weighted graph, Pattern Recognition Letters 12 (1991) 421-424. 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… CONTINUE READING