On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches (Q4565788): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Vladimir L. Boginski / rank | |||
| Property / author | |||
| Property / author: Vladimir L. Boginski / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.21791 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2770987319 / rank | |||
Normal rank | |||
Latest revision as of 15:39, 19 March 2024
scientific article; zbMATH DE number 6887387
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches |
scientific article; zbMATH DE number 6887387 |
Statements
On maximum degree‐based ‐quasi‐clique problem: Complexity and exact approaches (English)
0 references
13 June 2018
0 references
degree-based quasi-clique
0 references
quasi-clique
0 references
\(k\)-core
0 references
clique
0 references
clique relaxation
0 references
branch-and-bound
0 references
mixed integer programming
0 references
