Sorry, we do not have enough data to show an influence graph for this author.
- Full text PDF available (1)
Journals and Conferences
Partitioning of graphs has many practical applications namely in cluster analysis and in automated design of VLSI circuits. Using l-l correspondence between ultrametric partitions of a weighted complete graph K(w) on a finite set X and ultrametrics on X, the computational complexity of the approximation of w by means of an ultrametric u is investigated and… (More)