An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems (Q2354725)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6464057
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithmic framework for fixed-cardinality optimization in sparse graphs applied to dense subgraph problems |
scientific article; zbMATH DE number 6464057 |
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
0 references
0 references
0 references
0.89684325
0 references
0.8908566
0 references
0.8905779
0 references
0.88782954
0 references
0.8870718
0 references
0.8818224
0 references
0.8818224
0 references
0 references
0.88050646
0 references
