Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (Q2429325)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion |
scientific article |
Statements
Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion (English)
0 references
26 April 2012
0 references
computational intractability
0 references
NP-hard graph problem
0 references
polynomial-time data reduction
0 references
fixed-parameter tractability
0 references
graph-based data clustering
0 references
