Parameterized computational complexity of finding small-diameter subgraphs (Q1758028)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized computational complexity of finding small-diameter subgraphs |
scientific article |
Statements
Parameterized computational complexity of finding small-diameter subgraphs (English)
0 references
7 November 2012
0 references
clique relaxation
0 references
\(s\)-club
0 references
NP-hard problem
0 references
problem kernel
0 references
polynomial-time preprocessing
0 references
branching algorithm
0 references
0 references
