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

在任意给定的社会网络中寻找高舒适度团队的多项式时间近似算法

Polynomial-time Approximation Algorithm for finding Highly Comfortable Team in any given Social Network

Lakshmi Prabha S, T. N. Janakiraman

摘要:

社会网络分析(SNA)中有很多指标(测度或度量),如密度、凝聚力等。在影响一个群体的有效性的许多因素中,缺乏的一个因素是“舒适性”。因此,舒适性是成功团队工作的重要属性(特征)之一。在任何给定的社交网络中找到一个舒适和成功的团队是很重要的。基于\textbf{graph theoretic concepts}定义了社会网络中的舒适团队、较好舒适团队和高舒适团队,并分析了它们的结构性质。利用图论中的控制概念,证明了在任意连通网络中组建较好舒适团队或高舒适团队都是NP-完全的。接下来,我们给出了一个多项式时间近似算法,用于在任何给定的网络中找到这样一个高舒适度的团队,性能比为O(\ln Δ),其中Δ是给定网络(图)的最大度。证明了该算法的时间复杂度为O(n^{3}),其中n为网络(图)中的人数(顶点)。同时也证明了该算法合理地降低了离散率。

英文摘要:

There are many indexes (measures or metrics) in Social Network Analysis (SNA), like density, cohesion, etc. In this paper, we define a new SNA index called "comfortability". One among the lack of many factors, which affect the effectiveness of a group, is "comfortability". So, comfortability is one of the important attributes (characteristics) for a successful team work. It is important to find a comfortable and successful team in any given social network. In this paper, comfortable team, better comfortable team and highly comfortable team of a social network are defined based on \textbf{graph theoretic concepts} and some of their structural properties are analyzed. It is proved that forming better comfortable team or highly comfortable team in any connected network are NP-Complete using the concepts of domination in graph theory. Next, we give a polynomial-time approximation algorithm for finding such a highly comfortable team in any given network with performance ratio O(\ln Δ), where Δis the maximum degree of a given network (graph). The time complexity of the algorithm is proved to be O(n^{3}), where n is the number of persons (vertices) in the network (graph). It is also proved that our algorithm has reasonably reduced the dispersion rate.

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

↑