The complexity of detecting fixed-density clusters (Q2499577)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5045882
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of detecting fixed-density clusters |
scientific article; zbMATH DE number 5045882 |
Statements
The complexity of detecting fixed-density clusters (English)
0 references
14 August 2006
0 references
density-based clustering
0 references
computational complexity
0 references
graph algorithms
0 references
fixed-parameter problems
0 references
0 references
0 references
0.8276840448379517
0 references
0.8242537975311279
0 references
0.8050575256347656
0 references
0.782219409942627
0 references
