Hardness and tractability of the \(\gamma\)-complete subgraph problem (Q2032141)
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 7360067
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Hardness and tractability of the \(\gamma\)-complete subgraph problem |
scientific article; zbMATH DE number 7360067 |
Statements
Hardness and tractability of the \(\gamma\)\textsf{-Complete Subgraph} problem (English)
0 references
16 June 2021
0 references
\(\gamma\)-complete graph
0 references
clique relaxations
0 references
graph algorithms
0 references
parameterized complexity
0 references
0 references
0 references
0 references
0.7646046876907349
0 references
0.7479831576347351
0 references
0.7327369451522827
0 references
0.723654568195343
0 references
