A more relaxed model for graph-based data clustering: \(s\)-plex cluster editing (Q3013154)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A more relaxed model for graph-based data clustering: s-plex cluster editing |
scientific article; zbMATH DE number 5924701
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A more relaxed model for graph-based data clustering: \(s\)-plex cluster editing |
scientific article; zbMATH DE number 5924701 |
Statements
A More Relaxed Model for Graph-Based Data Clustering: <i>s</i>-Plex Cluster Editing (English)
0 references
18 July 2011
0 references
NP-hard problems
0 references
exact algorithms
0 references
fixed-parameter tractability
0 references
data reduction
0 references
graph modification
0 references
\(k\)-plex
0 references
dense subgraphs
0 references
forbidden subgraph characterization
0 references
0.9871700406074524
0 references
0.8322396874427795
0 references
0.8302335143089294
0 references
0.8077911734580994
0 references
0.8064989447593689
0 references
