Complexity of the cluster deletion problem on subclasses of chordal graphs (Q496003)
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: Complexity of the cluster deletion problem on subclasses of chordal graphs |
scientific article; zbMATH DE number 6482882
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of the cluster deletion problem on subclasses of chordal graphs |
scientific article; zbMATH DE number 6482882 |
Statements
Complexity of the cluster deletion problem on subclasses of chordal graphs (English)
0 references
16 September 2015
0 references
block graphs
0 references
cliques
0 references
edge deletion
0 references
cluster deletion
0 references
interval graphs
0 references
split graphs
0 references
submodular functions
0 references
chordal graphs
0 references
cographs
0 references
NP-completeness
0 references
0 references
0.8807080984115601
0 references
0.825434148311615
0 references
0.8135952949523926
0 references
0.8089624643325806
0 references
