Old Web
English
Sign In
Acemap
>
Paper
>
The complexity of finding compact well-separated clusters
The complexity of finding compact well-separated clusters
1986
M. Krivánek
Keywords:
Discrete mathematics
Combinatorics
NP-complete
Data structure
Graph theory
Cluster (physics)
Dynamic programming
Mathematics
Computer science
Theoretical computer science
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
1
Citations
NaN
KQI
[]