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.

Saved in:
Bibliographic Details
Published in:Optimization letters Vol. 6; no. 5; pp. 883 - 891
Main Authors: Schäfer, Alexander, Komusiewicz, Christian, Moser, Hannes, Niedermeier, Rolf
Format: Journal Article
Language:English
Published: Berlin/Heidelberg Springer-Verlag 01.06.2012
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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