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.

[1]  R. Alba.  A graph‐theoretic definition of a sociometric clique† , 1973 .

[2]  Yuichi Asahiro,et al.  Approximating Maximum Diameter-Bounded Subgraphs , 2010, LATIN.

[3]  Rolf Niedermeier,et al.  INTRODUCTION TO FIXED-PARAMETER ALGORITHMS , 2006 .

[4]  R. K. Mesta,et al.  Abstract , 1997, Veterinary Record.

[5]  James D. Laing,et al.  Coalitions and payoffs in three‐person sequential games: Initial tests of two formal models , 1973 .

[6]  Daniel Lokshtanov,et al.  New Methods in Parameterized Algorithms and Complexity , 2009 .

[7]  Michael R. Fellows,et al.  Parameterized Complexity , 1998 .

[8]  Jörg Flum,et al.  Parameterized Complexity Theory , 2006, Texts in Theoretical Computer Science. An EATCS Series.

[9]  Michael R. Fellows,et al.  Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] , 1995, Theor. Comput. Sci..

[10]  Lance Fortnow,et al.  Infeasibility of instance compression and succinct PCPs for NP , 2007, J. Comput. Syst. Sci..

[11]  Gilbert Laporte,et al.  Heuristics for finding k-clubs in an undirected graph , 2000, Comput. Oper. Res..

[12]  Rolf Niedermeier,et al.  Invitation to data reduction and problem kernelization , 2007, SIGA.

[13]  David L. Hicks,et al.  Notice of Violation of IEEE Publication PrinciplesDetecting Critical Regions in Covert Networks: A Case Study of 9/11 Terrorists Network , 2007, The Second International Conference on Availability, Reliability and Security (ARES'07).

[14]  Hans L. Bodlaender,et al.  Kernelization: New Upper and Lower Bound Techniques , 2009, IWPEC.

[15]  Alexander Schäfer,et al.  Exact algorithms for s-club finding and related problems , 2009 .

[16]  Rolf Niedermeier,et al.  Invitation to Fixed-Parameter Algorithms , 2006 .

[17]  Sergiy Butenko,et al.  Novel Approaches for Analyzing Biological Networks , 2005, J. Comb. Optim..

[18]  Henning Fernau,et al.  Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves , 2009, STACS.

[19]  Michael R. Fellows,et al.  On problems without polynomial kernels , 2009, J. Comput. Syst. Sci..

[20]  Gilbert Laporte,et al.  An exact algorithm for the maximum k-club problem in an undirected graph , 1999, Eur. J. Oper. Res..

[21]  Stephen B. Seidman,et al.  A graph‐theoretic generalization of the clique concept* , 1978 .

[22]  Srinivas Pasupuleti,et al.  Detection of Protein Complexes in Protein Interaction Networks Using n-Clubs , 2008, EvoBIO.

[23]  Bojan Mohar,et al.  On approximating the maximum diameter ratio of graphs , 2002, Discret. Math..