Mirko Krvanek

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Sorry, we do not have enough data to show an influence graph for this author.
Learn More
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)
  • 1