# Independent set (graph theory)

## Papers overview

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

Review

2017

Review

2017

- ArXiv
- 2017

Each year, the treatment decisions for more than 230, 000 breast cancer patients in the U.S. hinge on whether the cancer has… (More)

Is this relevant?

Review

2016

Review

2016

- 2016

Next-generation sequencing (NGS) is a rapidly evolving set of technologies that can be used to determine the sequence of an… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- 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

2000

Highly Cited

2000

- J. Algorithms
- 2000

Random independent sets in graphs arise, for example, in statistical physics, in the hard-core model of a gas. In 1997, Luby and… (More)

Is this relevant?

Highly Cited

1988

Highly Cited

1988

- 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

1986

Highly Cited

1986

- J. Algorithms
- 1986

An algorithm is presented which finds (the size of) a maximum independent set of an n vertex graph in time O(2°.276”) ’ p lm… (More)

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- STOC
- 1985

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

Is this relevant?

Highly Cited

1985

Highly Cited

1985

- J. Algorithms
- 1985

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

1980

Highly Cited

1980

- J. Comb. Theory, Ser. B
- 1980

A graph is claw-free if: whenever three (distinct) vertices are joined to a single vertex, those three vertices are a… (More)

Is this relevant?

Highly Cited

1978

Highly Cited

1978

- Math. Program.
- 1978

Let N be a finite set and z be a real-valued function defined on the set of subsets of N that satisfies z(S)+z(T)>-z(SUT)+z(SnT… (More)

Is this relevant?