Q4437509
type: Item
instance of: scholarly article
zbMATH Open document ID: 1032.68121
author: Klaus Holzapfel
author: Sven Kosub
author: Moritz G. Maaß
author: Hanjo Täubig
publication date: 2003-12-02T00:00:00Z
full work available at URL: 26530201.htm
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 2011857
zbMATH Keywords: Density-based clustering
zbMATH Keywords: computational complexity
zbMATH Keywords: graph algorithms
zbMATH Keywords: fixed-parameter problems
MaRDI profile type: Publication
Recommended article: The complexity of detecting fixed-density clusters
Recommended article: Q3747722
Recommended article: Q3774748
Recommended article: Q3115213
Recommended article: On the complexity of some cluster analysis problems
Recommended article: On the complexity of clustering with relaxed size constraints in fixed dimension
Recommended article: The complexity of the simultaneous cluster problem
Recommended article: On the Complexity of Clustering with Relaxed Size Constraints
Recommended article: Q6081722
Recommended article: The generic complexity of the bounded problem of graphs clustering
description: scientific article; zbMATH DE number 2011857