An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:16, 2 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems |
scientific article |
Statements
An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (English)
0 references
24 July 2015
0 references
clique relaxations
0 references
NP-hard problems
0 references
fixed-parameter algorithms
0 references
subgraph enumeration
0 references
