Semantic Scholar uses AI to extract papers important to this topic.
The Maximal Independent Set (MIS) problem is one of the basics in the study of locality in distributed graph algorithms. This… Expand We consider the problem of computing a maximal independent set (MIS) in an extremely harsh broadcast model that relies only on… Expand The greedy sequential algorithm for maximal independent set (MIS) loops over the vertices in an arbitrary order adding a vertex… Expand We present a novel distributed algorithm for the maximal independent set (MIS) problem. On growth-bounded graphs (GBG) our… Expand In ad hoc wireless networks, a connected dominating set can be used as a virtual backbone to improve the performance. Many… Expand Abstract We present an algorithm that generates all maximal independent sets of a graph in lexicographic order, with only… Expand Abstract A simple parallel randomized algorithm to find a maximal independent set in a graph G = ( V , E ) on n vertices is… Expand Two basic design strategies are used to develop a very simple and fast parallel algorithms for the maximal independent set (MIS… Expand Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo… Expand The problem of generating all the maximal independent sets (or maximal cliques) of a given graph is fundamental in graph theory… Expand