When can cluster deletion with bounded weights be solved efficiently? (Q6854636)
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 8162941
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | When can cluster deletion with bounded weights be solved efficiently? |
scientific article; zbMATH DE number 8162941 |
Statements
When can cluster deletion with bounded weights be solved efficiently? (English)
0 references
24 February 2026
0 references
graph clustering
0 references
split graphs
0 references
cographs
0 references
parameterized complexity
0 references
0 references
