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ženo v:
Podrobná bibliografie
Vydáno v:Optimization letters Ročník 6; číslo 5; s. 883 - 891
Hlavní autoři: Schäfer, Alexander, Komusiewicz, Christian, Moser, Hannes, Niedermeier, Rolf
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer-Verlag 01.06.2012
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:1862-4472
1862-4480
DOI:10.1007/s11590-011-0311-5