arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1803.00829cs.DScs.SI
收藏

伪分形无标度网和Sierpienski垫片中的独立数和最大独立集个数

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

Liren Shan, Huan Li, Zhongzhi Zhang

摘要:

最大独立集(MIS)问题作为理论计算机科学的一个基础课题,不仅具有理论意义,而且在各个领域都有着广泛的应用。然而,对于一般图,确定MIS的大小是NP-难的,并且精确计算所有MIS的数量甚至更困难。因此,寻找能精确求解MIS问题的特殊图具有重要意义。在本文中,我们解决了MIS问题的伪分形无标度网和Sierpienski垫片,其中有相同的顶点和边的数量。对于这两个图,我们确切地确定独立数和所有可能的MISs的数量。伪分形无标度网的独立数是Sierpienski垫片的2倍。此外,伪分形无标度网具有唯一的MIS,而Sierpienski垫片中的MIS的数量随着顶点的数量呈指数增长。

英文摘要:

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ński 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ński gasket. Moreover, the pseudofractal scale-free web has a unique MIS, while the number of MISs in the Sierpiński gasket grows exponentially with the number of vertices.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑