找最大独立集问题-FindingaMaximalIndependentSet

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了找最大独立集问题-FindingaMaximalIndependentSet，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含1148字，纯文字阅读大概需要2分钟。

内容图文

1. 独立集和最大独立集：A set of vertices I ? V is called independent if no pair of vertices in I is connected via an edge in G. An independent set is called maximal if by including any other vertex not in I, the independence property is vi

1. 独立集和最大独立集：A set of vertices I ? V is called independent if no pair of vertices in I is connected via an edge in G. An independent set is called maximal if by including any other vertex not in I, the independence property is violated.

下图是独立集和最大独立集的例子：

2. Finding a Maximal Independent Set (MIS)

1) Simple algorithms start byMIS I to be empty, and assigning all vertices to a candidate set C. Each vertex generates a(unique) random number and communicates it to its neighbZ喎?http://www.2cto.com/kf/ware/vc/" target="_blank" class="keylink">vcnMuPGJyPgoyKSBJZiB2ZXJ0ZXggdg=="s number less than that of all its neighbors, it joins set I. All of its neighbors are removed from C.
3) This process continuesuntil C is empty.

On average, this algorithmconverges after O(log|V|) such steps. 下图是找MIS的例子：

内容总结

以上是互联网集市为您收集整理的找最大独立集问题-FindingaMaximalIndependentSet全部内容，希望文章能够帮你解决找最大独立集问题-FindingaMaximalIndependentSet所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端