Maximal independent set

Known as: Minimum independent dominating set, Minimum maximal independent set, Minimum maximal indepent set 
In graph theory, a maximal independent set (MIS) or maximal stable set is an independent set that is not a subset of any other independent set. In… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1944-2017
05010019442016

Papers overview

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… (More)
Is this relevant?
2011
2011
We consider the problem of computing a maximal independent set (MIS) in an extremely harsh broadcast model that relies only on… (More)
  • figure 1
Is this relevant?
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… (More)
Is this relevant?
Highly Cited
2005
Highly Cited
2005
The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknown… (More)
  • figure 1
Is this relevant?
1989
1989
f a The problem of constructing in parallel a maximal independent set o given graph is considered. A new deterministic NC… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Generating all configurations that satisfy a given specification (e.g., all permutations of n objects that do not fix any object… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
A new parallel algorithm for the maximal independent set problem (MIS) is constructed. It runs in O(log4 n) time when implemented… (More)
Is this relevant?
Highly Cited
1986
Highly Cited
1986
A simple parallel randomized algorithm to find a maximal independent set in a graph G = (V, E) on n vertices is presented. Its… (More)
Is this relevant?
Highly Cited
1984
Highly Cited
1984
A parallel algorithm is presented that accepts as input a graph <italic>G</italic> and produces a maximal independent set of… (More)
Is this relevant?