Parameterized computational complexity of finding small-diameter subgraphs (Q1758028)
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 6102928
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized computational complexity of finding small-diameter subgraphs |
scientific article; zbMATH DE number 6102928 |
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
0.8005934953689575
0 references
0.794699490070343
0 references
0.7487522959709167
0 references
