Using shortcut edges to maximize the number of triangles in graphs (Q1785441)
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: Using shortcut edges to maximize the number of triangles in graphs |
scientific article; zbMATH DE number 6945417
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using shortcut edges to maximize the number of triangles in graphs |
scientific article; zbMATH DE number 6945417 |
Statements
Using shortcut edges to maximize the number of triangles in graphs (English)
0 references
28 September 2018
0 references
triangles
0 references
graphs
0 references
NP-complete
0 references
approximation algorithm
0 references
0 references
0 references
