The complexity of ultrametric partitions on graphs
type: Item
instance of: scholarly article
title: The complexity of ultrametric partitions on graphs
zbMATH Open document ID: 0637.68047
DOI: 10.1016/0020-0190(88)90090-7
author: Mirko Křivánek
published in: Information Processing Letters
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 4039290
zbMATH Keywords: cluster analysis
zbMATH Keywords: automated design
zbMATH Keywords: VLSI circuits
zbMATH Keywords: ultrametric partitions
zbMATH Keywords: weighted complete graph
zbMATH Keywords: computational complexity
zbMATH Keywords: polynomial algorithm
MaRDI profile type: Publication
full work available at URL: 0020-0190(88)90090-7
OpenAlex ID: W2130327313
cites work: Q4741545
cites work: Bottleneck extrema
cites work: Q4198056
cites work: Q4085109
cites work: NP-hard problems in hierarchical-tree clustering
cites work: Q3219752
description: scientific article; zbMATH DE number 4039290