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

Saibal Banerjee. An optimal algorithm to find the degrees of connectedness in an undirected edge-weighted graph. Pattern Recognition Letters, 12(7):421-424, 1991.

Abstract

Abstract is missing.