Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407)
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: Maximizing the strong triadic closure in split graphs and proper interval graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximizing the strong triadic closure in split graphs and proper interval graphs |
scientific article |
Statements
Maximizing the strong triadic closure in split graphs and proper interval graphs (English)
0 references
31 August 2020
0 references
strong triadic closure
0 references
polynomial-time algorithm
0 references
NP-completeness
0 references
split graphs
0 references
proper interval graphs
0 references
0 references
0.998306155204773
0 references
0.8285226821899414
0 references
0.8270531892776489
0 references
0.8141002058982849
0 references
0.8126791715621948
0 references
