Algorithms and complexity of \(s\)-club cluster vertex deletion (Q2115849)
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 7495020
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms and complexity of \(s\)-club cluster vertex deletion |
scientific article; zbMATH DE number 7495020 |
Statements
Algorithms and complexity of \(s\)-club cluster vertex deletion (English)
0 references
22 March 2022
0 references
vertex deletion problem
0 references
\(s\)-club
0 references
split graphs
0 references
(planar) bipartite graphs
0 references
NP-hardness
0 references
APX-hardness
0 references
trapezoid graphs
0 references
polynomial-time algorithms
0 references
0 references
0 references
