Independence number and the number of maximum independent sets in pseudofractal scale-free web and Sierpiński gasket

As a fundamental subject of theoretical computer science, the maximum independent set (MIS) problem not only is of purely theoretical interest, but also has found wide applications in various fields. However, for a general graph determining the size of a MIS is NP-hard, and exact computation of the number of all MISs is even more difficult. It is thus of significant interest to seek special graphs for which the MIS problem can be exactly solved. In this paper, we address the MIS problem in the pseudofractal scale-free web and the Sierpi\'nski gasket, which have the same number of vertices and edges. For both graphs, we determine exactly the independence number and the number of all possible MISs. The independence number of the pseudofractal scale-free web is as twice as the one of the Sierpi\'nski gasket. Moreover, the pseudofractal scale-free web has a unique MIS, while the number of MISs in the Sierpi\'nski gasket grows exponentially with the number of vertices.

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

[2]  Raffaele Mosca,et al.  A sufficient condition to extend polynomial results for the Maximum Independent Set Problem , 2017, Discret. Appl. Math..

[3]  Tatsuya Akutsu,et al.  Dominating scale-free networks with variable scaling exponent: heterogeneous networks are not difficult to control , 2012 .

[4]  Albert-László Barabási,et al.  Controllability of complex networks , 2011, Nature.

[5]  Russell Impagliazzo,et al.  The Resolution Complexity of Independent Sets and Vertex Covers in Random Graphs , 2007, computational complexity.

[6]  Vangelis Th. Paschos,et al.  A priori optimization for the probabilistic maximum independent set problem , 2002, Theor. Comput. Sci..

[7]  Kihong Park,et al.  On the Hardness of Optimization in Power Law Graphs , 2007, COCOON.

[8]  Bin Wu,et al.  Pfaffian orientations and perfect matchings of scale-free networks , 2015, Theor. Comput. Sci..

[9]  Magnús M. Halldórsson,et al.  SDP-Based Algorithms for Maximum Independent Set Problems on Hypergraphs , 2009, ICALP.

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

[11]  Hiroshi Nagamochi,et al.  Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs , 2013, Theor. Comput. Sci..

[12]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[13]  Vadim V. Lozin,et al.  On the maximum independent set problem in subclasses of subcubic graphs , 2013, J. Discrete Algorithms.

[14]  Mark E. J. Newman,et al.  The Structure and Function of Complex Networks , 2003, SIAM Rev..

[15]  Shuigeng Zhou,et al.  Evolving pseudofractal networks , 2007 .

[16]  Yu Liu,et al.  Towards Maximum Independent Sets on Massive Graphs , 2015, Proc. VLDB Endow..

[17]  Piotr Berman,et al.  Approximating maximum independent set in bounded degree graphs , 1994, SODA '94.

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

[19]  S. N. Dorogovtsev,et al.  Pseudofractal scale-free web. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Hiroshi Nagamochi,et al.  An exact algorithm for maximum independent set in degree-5 graphs , 2016, Discret. Appl. Math..

[21]  Jaikumar Radhakrishnan,et al.  Greed is good: Approximating independent sets in sparse and bounded-degree graphs , 1997, Algorithmica.

[22]  S. Havlin,et al.  Self-similarity of complex networks , 2005, Nature.

[23]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..

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

[25]  Zhongzhi Zhang,et al.  Domination number and minimum dominating sets in pseudofractal scale-free web and Sierpiński graph , 2017, Theor. Comput. Sci..

[26]  Julia Chuzhoy,et al.  On Approximating Maximum Independent Set of Rectangles , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[27]  Wei Li,et al.  Computing A Near-Maximum Independent Set in Linear Time by Reducing-Peeling , 2017, SIGMOD Conference.

[28]  Kneevic,et al.  Large-scale properties and collapse transition of branched polymers: Exact results on fractal lattices. , 1986, Physical review letters.

[29]  F. Chung,et al.  The average distances in random graphs with given expected degrees , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[30]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[31]  J. Jeffry Howbert,et al.  The Maximum Clique Problem , 2007 .

[32]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[33]  Diogo Vieira Andrade,et al.  Fast local search for the maximum independent set problem , 2008, Journal of Heuristics.

[34]  Peter Sanders,et al.  Finding Near-Optimal Independent Sets at Scale , 2016, ALENEX.

[35]  Wing-Kai Hon,et al.  On maximum independent set of categorical product and ultimate categorical ratios of graphs , 2015, Theor. Comput. Sci..

[36]  Peter Sanders,et al.  Accelerating Local Search for the Maximum Independent Set Problem , 2016, SEA.

[37]  Panos M. Pardalos,et al.  Finding maximum independent sets in graphs arising from coding theory , 2002, SAC '02.

[38]  Robert E. Tarjan,et al.  Finding a Maximum Independent Set , 1976, SIAM J. Comput..

[39]  Lorna Stewart,et al.  Maximum independent set and maximum clique algorithms for overlap graphs , 2003, Discret. Appl. Math..

[40]  Derrick Kondo,et al.  A maximum independent set approach for collusion detection in voting pools , 2011, J. Parallel Distributed Comput..

[41]  William Staton,et al.  Graphs with unique maximum independent sets , 1985, Discret. Math..

[42]  Stefano Basagni,et al.  Finding a Maximal Weighted Independent Set in Wireless Networks , 2001, Telecommun. Syst..

[43]  Shuigeng Zhou,et al.  Exact solution for mean first-passage time on a pseudofractal scale-free web. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[44]  Ness B. Shroff,et al.  Distributed Greedy Approximation to Maximum Weighted Independent Set for Scheduling With Fading Channels , 2013, IEEE/ACM Transactions on Networking.