Independent set (graph theory)

Known as: Vertex independent set, Vertex packing, Coclique 
In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent. That is, it is a set S of vertices… (More)
Wikipedia

Related topics

Related topics

50 relations
APXAlgorithmicaBaker's techniqueBrute-force search
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
Detecting Cancer Metastases on Gigapixel Pathology Images
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
Creating a universal SNP and small indel variant caller with deep neural networks
Next-generation sequencing (NGS) is a rapidly evolving set of technologies that can be used to determine the sequence of an… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs
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
2000
Highly Cited
2000
On Markov Chains for Independent Sets
Random independent sets in graphs arise, for example, in statistical physics, in the hard-core model of a gas. In 1997, Luby and… (More)
  • figure 1
Is this relevant?
Highly Cited
1988
Highly Cited
1988
On Generating All Maximal Independent Sets
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
Algorithms for Maximum Independent Sets
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
A Simple Parallel Algorithm for the Maximal Independent Set Problem
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
A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem
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
On maximal independent sets of vertices in claw-free graphs
A graph is claw-free if: whenever three (distinct) vertices are joined to a single vertex, those three vertices are a… (More)
  • figure I
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
1978
Highly Cited
1978
An analysis of approximations for maximizing submodular set functions - I
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?