Parameterized computational complexity of finding small-diameter subgraphs (Q1758028): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11590-011-0311-5 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2051438793 / rank | |||
Revision as of 05:34, 21 March 2024
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
