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

Topic mentions per year

Topic mentions per year

1952-2017
010020019522016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
  • Magnús M. Halldórssonz, Jaikumar Radhakrishnanx
  • 2011
The minimum-degree greedy algorithm, or Greedy for short, is a simple and well studied method for nding independent sets in… (More)
Is this relevant?
Highly Cited
2009
Highly Cited
2009
In this paper, we investigate the use of message-passing algorithms for the problem of finding the max-weight independent set… (More)
  • figure 1
  • figure 2
  • figure 3
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
2006
Highly Cited
2006
Consider the problem of approximately counting weighted independent sets of a graph G with activity λ, i.e., where the weight of… (More)
  • figure 1
Is this relevant?
Highly Cited
2004
Highly Cited
2004
A family of circuits of a graph G is said to be independent if no two of the circuits have a common vertex ; it is called edge… (More)
Is this relevant?
Highly Cited
2001
Highly Cited
2001
This paper introduces MWIS, a distributed algorithm for the efficient determination of a maximal weighted independent set in the… (More)
  • figure 1
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?
Highly Cited
1980
Highly Cited
1980
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
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?