An order-based algorithm for minimum dominating set with application in graph mining

Abstract Dominating set is a set of vertices of a graph such that all other vertices have a neighbour in the dominating set. We propose a new order-based randomised local search (RLSo) algorithm to solve minimum dominating set problem in large graphs. Experimental evaluation is presented for multiple types of problem instances. These instances include unit disk graphs, which represent a model of wireless networks, random scale-free networks, as well as samples from two social networks and real-world graphs studied in network science. Our experiments indicate that RLSo performs better than both a classical greedy approximation algorithm and two metaheuristic algorithms based on ant colony optimisation and local search. The order-based algorithm is able to find small dominating sets for graphs with tens of thousands of vertices. In addition, we propose a multi-start variant of RLSo that is suitable for solving the minimum weight dominating set problem. The application of RLSo in graph mining is also briefly demonstrated.

[1]  Lawrence B. Holder,et al.  Mining Graph Data , 2006 .

[2]  T. Ibaraki,et al.  The Computational Complexity of the m -Center Problems on the Plane , 1981 .

[3]  Béla Bollobás,et al.  Mathematical results on scale‐free random graphs , 2005 .

[4]  Konstantin Avrachenkov,et al.  Cooperative Game Theory Approaches for Network Partitioning , 2017, COCOON.

[5]  Alok Singh,et al.  Hybrid metaheuristic algorithms for minimum weight dominating set , 2013, Appl. Soft Comput..

[6]  Christian Blum,et al.  A hybrid algorithmic model for the minimum weight dominating set problem , 2016, Simul. Model. Pract. Theory.

[7]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[8]  Marek Karpinski,et al.  Inapproximability of dominating set on power law graphs , 2012, Theor. Comput. Sci..

[9]  Charu C. Aggarwal,et al.  Graph Clustering , 2010, Encyclopedia of Machine Learning and Data Mining.

[10]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11]  L. Takac.  DATA ANALYSIS IN PUBLIC SOCIAL NETWORKS , 2012 .

[12]  Carson C. Chow,et al.  Small Worlds , 2000 .

[13]  Anupama Potluri,et al.  Two Hybrid Meta-heuristic Approaches for Minimum Dominating Set Problem , 2011, SEMCCO.

[14]  C. Lee Giles,et al.  Efficient identification of Web communities , 2000, KDD '00.

[15]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  Martin Nehéz,et al.  Comparison of algorithms for near-optimal dominating sets computation in real-world networks , 2015, CompSysTech '15.

[17]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[18]  Abhay Parekh,et al.  Analysis of a Greedy Heuristic for Finding Small Dominating Sets in Graphs , 1991, Inf. Process. Lett..

[19]  M. Tuba,et al.  Ant colony optimization applied to minimum weight dominating set problem , 2010 .

[20]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[21]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[22]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[23]  Milan Tuba,et al.  Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem , 2013, Comput. Sci. Inf. Syst..

[24]  Clara Pizzuti,et al.  A Multiobjective Genetic Algorithm to Find Communities in Complex Networks , 2012, IEEE Transactions on Evolutionary Computation.

[25]  Ali S. Hadi,et al.  Finding Groups in Data: An Introduction to Chster Analysis , 1991 .

[26]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

[27]  Jeff T. Linderoth,et al.  MILP Software , 2010 .

[28]  S. Hedetniemi,et al.  Domination in graphs : advanced topics , 1998 .

[29]  Kenneth A. Hawick,et al.  Detecting and Labelling Wireless Community Network Structures from Eigen-spectra , 2010, ICWN.

[30]  Louis Anthony Cox,et al.  Wiley encyclopedia of operations research and management science , 2011 .

[31]  Frank Neumann,et al.  Bioinspired computation in combinatorial optimization: algorithms and their computational complexity , 2012, GECCO '12.

[32]  M. Montaz Ali,et al.  An Effective Hybrid Memetic Algorithm for the Minimum Weight Dominating Set Problem , 2016, IEEE Transactions on Evolutionary Computation.

[33]  Janise McNair,et al.  Weight based dominating set clustering algorithm for small satellite networks , 2012, 2012 IEEE International Conference on Communications (ICC).

[34]  Tao Li,et al.  Multi-Document Summarization via the Minimum Dominating Set , 2010, COLING.

[35]  Laura A. Sanchis,et al.  Experimental Analysis of Heuristic Algorithms for the Dominating Set Problem , 2002, Algorithmica.

[36]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[37]  Alok Singh,et al.  A hybrid evolutionary algorithm with guided mutation for minimum weight dominating set , 2015, Applied Intelligence.

[38]  Satu Elisa Schaeffer,et al.  Graph Clustering , 2017, Encyclopedia of Machine Learning and Data Mining.

[39]  Donald E. Knuth,et al.  The Stanford GraphBase - a platform for combinatorial computing , 1993 .

[40]  Ingo Wegener,et al.  Randomized local search, evolutionary algorithms, and the minimum spanning tree problem , 2004, Theor. Comput. Sci..

[41]  Minghao Yin,et al.  Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function , 2017, J. Artif. Intell. Res..

[42]  Gérard Cornuéjols,et al.  An algorithmic framework for convex mixed integer nonlinear programs , 2008, Discret. Optim..

[43]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[44]  Jure Leskovec,et al.  Empirical comparison of algorithms for network community detection , 2010, WWW '10.

[45]  Hae-Sang Park,et al.  A simple and fast algorithm for K-medoids clustering , 2009, Expert Syst. Appl..

[46]  M. Chleb ´ õk,et al.  Approximation Hardness of Dominating Set Problems in Bounded Degree Graphs , 2008 .

[47]  Anurag Singh Baghel,et al.  New Metaheuristic Approaches for the Leaf-Constrained Minimum Spanning Tree Problem , 2008, Asia Pac. J. Oper. Res..

[48]  Geng Lin.  A hybrid self-adaptive evolutionary algorithm for the minimum weight dominating set problem , 2016, Int. J. Wirel. Mob. Comput..

[49]  Jie Wu,et al.  An extended localized algorithm for connected dominating set formation in ad hoc wireless networks , 2004, IEEE Transactions on Parallel and Distributed Systems.

[50]  My T. Thai,et al.  On the approximability of positive influence dominating set in social networks , 2014, J. Comb. Optim..

[51]  Yan Shi,et al.  On positive influence dominating sets in social networks , 2011, Theor. Comput. Sci..

[52]  Clara Pizzuti,et al.  Algorithms and tools for protein-protein interaction networks clustering, with a special focus on population-based stochastic methods , 2014, Bioinform..

[53]  Roger Wattenhofer,et al.  Constant-time distributed dominating set approximation , 2003, PODC '03.

[54]  Paul W. Goldberg,et al.  Bounds for the convergence rate of randomized local search in a multiplayer load-balancing game , 2004, PODC '04.

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

[56]  Christos Faloutsos,et al.  Graph mining: Laws, generators, and algorithms , 2006, CSUR.

[57]  Suresh Varma Penumathsa,et al.  Dominating Sets and Spanning Tree based Clustering Algorithms for Mobile Ad hoc Networks , 2011 .

[58]  Abdel-Rahman Hedar,et al.  Hybrid Genetic Algorithm for Minimum Dominating Set Problem , 2010, ICCSA.