Strong triadic closure in cographs and graphs of low maximum degree (Q5915633)
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 6882317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Strong triadic closure in cographs and graphs of low maximum degree |
scientific article; zbMATH DE number 6882317 |
Statements
Strong triadic closure in cographs and graphs of low maximum degree (English)
0 references
8 June 2018
0 references
strong triadic closure
0 references
cluster deletion
0 references
cographs
0 references
bounded degree graphs
0 references
NP-completeness
0 references
polynomial-time algorithm
0 references
0.9947147965431212
0 references
0.8310045003890991
0 references
0.8270531892776489
0 references
