An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SparseMatrix / rank | |||
Normal rank | |||
Revision as of 01:07, 1 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph |
scientific article |
Statements
An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (English)
0 references
7 January 2021
0 references
quasi-clique
0 references
clique relaxations
0 references
graph-based data mining
0 references
Lagrangian duality
0 references
