An O ∗ ( 1 . 4658 n )-time exact algorithm for the maximum bounded-degree-1 set problem

A bounded-degree-1 set S in an undirected graph G = (V,E) is a vertex subset such that the maximum degree of G[S] is at most one. Given a graph G, the Maximum Bounded-Degree1 Set problem is to find a bounded-degree-1 set S of maximum size in G. A notion related to bounded-degree sets is that of an s-plex used to define the cohesiveness of subgraphs in social networks. An s-plex S in a graph G = (V,E) is a vertex subset such that for each v ∈ S, degG[S](v) ≥ |S| − s. One can easily show that a graph G has a 2-plex of size k iff the complement graph of G has a bounded-degree-1 set of size k. Both the Maximum 2-Plex problem and the Maximum Bounded-Degree-1 Set problem are NPhard. We give a simple branch-and-reduce algorithm using branching strategies with at most three branches for the Maximum Bounded-Degree1 Set problem. We analyze the running time of the algorithm using measure-and-conquer and show that it runs in time O(1.4658) which is faster than previous exact algorithms. This research is partially supported by the National Science Council of Taiwan under grants NSC 101–2221–E– 241–019–MY3 and NSC 102–2221–E–241–007–MY3. Ling-Ju Hung (corresponding author) is supported by the National Science Council of Taiwan under grant NSC 102–2811–E–241–001.

[1]  Christian Komusiewicz,et al.  Isolation concepts for efficiently enumerating dense subgraphs , 2009, Theor. Comput. Sci..

[2]  Maw-Shang Chang,et al.  Measure and Conquer : Analysis of a Branch-and-Reduce Algorithm for the Maximum Bounded-degree-1 Set Problem , 2012 .

[3]  Vangelis Th. Paschos,et al.  Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms , 2011, Discret. Appl. Math..

[4]  Balabhaskar Balasundaram,et al.  Approximation algorithms for finding and partitioning unit-disk graphs into co-k-plexes , 2010, Optim. Lett..

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

[6]  Maw-Shang Chang,et al.  Moderately Exponential Time Approximation Algorithms for the Maximum Bounded-degreed Set Problem , 2015 .

[7]  Rolf Niedermeier,et al.  Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion , 2009, Algorithmica.

[8]  Sergiy Butenko,et al.  Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem , 2011, Oper. Res..

[9]  David Eppstein,et al.  Quasiconvex analysis of backtracking algorithms , 2003, SODA '04.

[10]  John Michael Robson,et al.  Algorithms for Maximum Independent Sets , 1986, J. Algorithms.

[11]  Bin Wu,et al.  A Parallel Algorithm for Enumerating All the Maximal k -Plexes , 2007, PAKDD Workshops.

[12]  Fedor V. Fomin,et al.  Exact exponential algorithms , 2013, CACM.

[13]  Fabrizio Grandoni,et al.  A measure & conquer approach for the analysis of exact algorithms , 2009, JACM.

[14]  Christian Komusiewicz,et al.  A More Relaxed Model for Graph-Based Data Clustering: s-Plex Cluster Editing , 2010, SIAM J. Discret. Math..

[15]  Baski Balasundaram Cohesive subgroup model for graph-based text mining , 2008, 2008 IEEE International Conference on Automation Science and Engineering.

[16]  David Eppstein,et al.  3-Coloring in Time O(1.3289^n) , 2000, J. Algorithms.

[17]  Dimitrios M. Thilikos,et al.  Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover , 2001, Discret. Appl. Math..

[18]  Svyatoslav Trukhanov,et al.  Novel approaches for solving large-scale optimization problems on graphs , 2009 .

[19]  David Eppstein,et al.  Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms , 2006, TALG.

[20]  Rolf Niedermeier,et al.  On Bounded-Degree Vertex Deletion parameterized by treewidth , 2012, Discret. Appl. Math..

[21]  Illya V. Hicks,et al.  Combinatorial algorithms for the maximum k-plex problem , 2012, J. Comb. Optim..

[22]  Fabrizio Grandoni,et al.  Measure and conquer: a simple O(20.288n) independent set algorithm , 2006, SODA '06.

[23]  Rolf Niedermeier,et al.  Exact combinatorial algorithms and experiments for finding maximum k-plexes , 2012, J. Comb. Optim..

[24]  Rolf Niedermeier,et al.  A Generalization of Nemhauser and Trotter's Local Optimization Theorem , 2009, STACS.

[25]  Fabrizio Grandoni,et al.  Measure and Conquer: Domination - A Case Study , 2005, ICALP.

[26]  Zhi-Zhong Chen,et al.  A Linear Kernel for Co-Path/Cycle Packing , 2010, AAIM.