scientific article; zbMATH DE number 3984569

MaRDI QIDQ3747722zbMATH OpenFDO

Authors Mirko Křivánek

Publication date 1986

zbMATH Keywords

NP-completenessnonhierarchical clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• The complexity of detecting fixed-density clusters
• scientific article; zbMATH DE number 2011857
• scientific article; zbMATH DE number 4034897
• On the complexity of some problems of searching for a family of disjoint clusters
• On the complexity of some cluster analysis problems
• The complexity of the simultaneous cluster problem
• On the Complexity of Clustering with Relaxed Size Constraints
• scientific article; zbMATH DE number 2081029
• scientific article; zbMATH DE number 6007853
• scientific article; zbMATH DE number 7746258

Cited in

(6)

• scientific article; zbMATH DE number 4034897 (Why is no real title available?)
• scientific article; zbMATH DE number 2081029 (Why is no real title available?)
• On the Complexity of Clustering with Relaxed Size Constraints
• scientific article; zbMATH DE number 2011857 (Why is no real title available?)
• scientific article; zbMATH DE number 6861937 (Why is no real title available?)
• The complete optimal stars-clustering-tree problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3747722)