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)

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

Highly Cited

2016

Highly Cited

2016

- Mohsen Ghaffari
- SODA
- 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

- Yehuda Afek, Noga Alon, Ziv Bar-Joseph, Alejandro Cornejo, Bernhard Haeupler, Fabian Kuhn
- Distributed Computing
- 2011

We consider the problem of computing a maximal independent set (MIS) in an extremely harsh broadcast model that relies only onâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Johannes Schneider, Roger Wattenhofer
- PODC
- 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

- Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger Wattenhofer
- DISC
- 2005

The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importanceâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Thomas Moscibroda, Roger Wattenhofer
- PODC
- 2005

We study the distributed complexity of computing a maximal independent set (MIS) in radio networks with completely unknownâ€¦Â (More)

Is this relevant?

1989

1989

- Mark K. Goldberg, Thomas H. Spencer
- SIAM J. Discrete Math.
- 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

- David S. Johnson, Christos H. Papadimitriou, Mihalis Yannakakis
- Inf. Process. Lett.
- 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

- Mark K. Goldberg, Thomas H. Spencer
- 28th Annual Symposium on Foundations of Computerâ€¦
- 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

- Noga Alon, LÃ¡szlÃ³ Babai, Alon Itai
- J. Algorithms
- 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

- Richard M. Karp, Avi Wigderson
- STOC
- 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?