Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2016

Highly Cited

2016

The Maximal Independent Set (MIS) problem is one of the basics in the study of locality in distributed graph algorithms. This… Expand

Highly Cited

2012

Highly Cited

2012

We consider the problem of computing a maximal independent set (MIS) in an extremely harsh broadcast model that relies only on… Expand

Highly Cited

2012

Highly Cited

2012

The greedy sequential algorithm for maximal independent set (MIS) loops over the vertices in an arbitrary order adding a vertex… Expand

Highly Cited

2008

Highly Cited

2008

We present a novel distributed algorithm for the maximal independent set (MIS) problem. On growth-bounded graphs (GBG) our… Expand

Highly Cited

2006

Highly Cited

2006

In ad hoc wireless networks, a connected dominating set can be used as a virtual backbone to improve the performance. Many… Expand

Highly Cited

1988

Highly Cited

1988

Abstract We present an algorithm that generates all maximal independent sets of a graph in lexicographic order, with only… Expand

Highly Cited

1986

Highly Cited

1986

Abstract A simple parallel randomized algorithm to find a maximal independent set in a graph G = ( V , E ) on n vertices is… Expand

Highly Cited

1986

Highly Cited

1986

Two basic design strategies are used to develop a very simple and fast parallel algorithms for the maximal independent set (MIS… Expand

Highly Cited

1985

Highly Cited

1985

Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo… Expand

Highly Cited

1977

Highly Cited

1977

The problem of generating all the maximal independent sets (or maximal cliques) of a given graph is fundamental in graph theory… Expand