Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Maximal Independent Set (MIS) is one of the central problems in distributed graph algorithms. The celebrated works of Luby [STOC… 
2018
2018
Most graphs in real life keep changing with time. These changes can be in the form of insertion or deletion of edges or vertices… 
Highly Cited
2016
Highly Cited
2016
  • M. Ghaffari
  • ACM-SIAM Symposium on Discrete Algorithms
  • 2016
  • Corpus ID: 14924429
The Maximal Independent Set (MIS) problem is one of the basics in the study of locality in distributed graph algorithms. This… 
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… 
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… 
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… 
Highly Cited
1988
Highly Cited
1988
Highly Cited
1985
Highly Cited
1985
  • M. Luby
  • Symposium on the Theory of Computing
  • 1985
  • Corpus ID: 1126858
Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo… 
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…