Schneider, J., Wattenhofer, R.: An optimal maximal inde- pendent set algorithm for bounded-independence graphs. Distrib. Comput. 22(5-6), 1-13 (2010)An optimal maximal independent set algorithm for bounded-independence graphs, Dis- trib. Comput., 22 (2010), pp. 1-13....
前言:关于Maximal Independent Set(MIS)的基础知识參考我的博客《找最大独立集问题-Finding a Maximal Independent Set》。 1. 本算法參考 Luby's classic parallel algorithm《a simple parallel algorithm for maximal independent set problem》,把顶点分为三类: 1) S:The MIS being constructed. Starts empty and...
We present a novel distributed algorithm for the maximal independent set (MIS) problem. On growth-bounded graphs (GBG) our deterministic algorithm finishes in O(log* n) time, n being the number of nodes. In light of Linial's Ω(log* n) lower bound our algorithm is asymptotically op...
1)maximal independent set极大独立集 1.A general method for generating all maximal independent sets of a graph;生成图的全部极大独立集的一般方法 2.New algorithm of maximal independent set and upper bound of independent number;一个新的极大独立集算法及独立数的界 3.In seeking maximal independent se...
maximal independent set problemA simple parallel randomized algorithm to find a maximal independent set in a graph G = (V, E) on n vertices is presented. Its expected running time on a concurrent-read concurrent-write PRAM with O(|E|dmax) processors is O(log n), where dmax denotes the ...
网络释义 1. 极大独立集 ...独立集.或者说是导出的子图是零图(没有边)的点集.极大独立集(maximal independent set):本身为独立集,再加入任何点都不是. … www.cnblogs.com|基于8个网页 2. 最大独立集 最大独立子集,maximum independent... ... ) Maximum independent set 最大独立集 )maximal independen...
self-stabilizationmaximal independent setMIS treek-clusteringIn this paper, we propose a silent self-stabilizing asynchronous distributed algorithm for ... AK Datta,LL Larmore,S Devismes,... - IEEE 被引量: 27发表: 2012年 SELF-STABILIZING ALGORITHMS FOR ORDERINGS AND COLORINGS A k-forward numbe...
An anonymous self-stabilizing algorithm for 1-maximal independent set in trees We present an anonymous, constant-space, self-stabilizing algorithm for finding a 1-maximal independent set in tree graphs (and some rings). We show that t... GST Hedetniemi - 《Information Processing Letters》 被引...
Two basic design strategies are used to develop a very simple and fast parallel algorithms for the maximal independent set (MIS) problem. The first strategy consists of assigning identical copies of a simple algorithm to small local portions of the problem input. The algorithm is designed so that...
vertex: respective indications that each neighbor vertex connected to the first vertex by one of the edges is not to be included in a maximal independent set for the undirected graph; and an indication that the first vertex is to be included in the maximal independent set for the undirected ...