Strong triadic closure in cographs and graphs of low maximum degree (Q5915633): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2018.05.012 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2018.05.012 / rank | |||
Normal rank | |||
Latest revision as of 23:58, 10 December 2024
scientific article; zbMATH DE number 6882317
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
