Parameterized computational complexity of finding small-diameter subgraphs

Finding subgraphs of small diameter in undirected graphs has been seemingly unexplored from a parameterized complexity perspective. We perform the first parameterized complexity study on the corresponding NP-hard s - Club problem. We consider two parameters: the solution size and its dual.

Uložené v:

Podrobná bibliografia
Vydané v:	Optimization letters Ročník 6; číslo 5; s. 883 - 891
Hlavní autori:	Schäfer, Alexander, Komusiewicz, Christian, Moser, Hannes, Niedermeier, Rolf
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer-Verlag 01.06.2012
Predmet:	Computational Intelligence Mathematics Mathematics and Statistics Numerical and Computational Physics Operations Research/Decision Theory Optimization Original Paper Simulation Clique relaxation Branching algorithm NP-hard problem Polynomial-time preprocessing Club Problem kernel
ISSN:	1862-4472, 1862-4480
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!