Skip to search formSkip to main contentSkip to account menu

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
We study a turbo equalization scheme based on low-density parity-check (LDPC) coded turbo equalization (TE). This scheme is… 
2007
2007
We use a new structural theorem on the presence of two-pairs in weakly chordal graphs to develop improved algorithms. For the… 
2006
2006
We extend our previous work on structural steganalysis of LSB replacement in digital images, building detectors which analyse the… 
Highly Cited
1991
Highly Cited
1991
  • S. KuoIng-Yi Chen
  • 1991
  • Corpus ID: 3045412
A systematic method for reconfiguration in VLSI/WSI (wafer scale integration) arrays using the degradation approach for yield… 
Highly Cited
1988
Highly Cited
1988
  • J. CongC. Liu
  • 1988
  • Corpus ID: 1108094
A common approach to the over-the-cell channel routing problem is to divide the problem into three steps: (1) routing over the… 
Highly Cited
1986
Highly Cited
1986
  • Tang Jian
  • 1986
  • Corpus ID: 45765245
A faster algorithm for finding a maximum independent set in a graph is presented. The algorithm is an improved version of the one… 
Highly Cited
1986
Highly Cited
1986
The γ-chain genes are encoded by immunoglobulin-like gene segments in germline DNA which rearrange during the somatic development… 
Highly Cited
1984
Highly Cited
1984
Two hundred and ninety-nine plots of Pinus radiata D. Don in forests throughout the North Island of New Zealand were sampled. At… 
Highly Cited
1982
Highly Cited
1982
We relate the simple plant location problem to the vertex packing problem and derive several classes of facets of their… 
1977
1977
A wide variety of queueing systems with a single server can be modeled by the equation b<inf>n+1</inf> = (b<inf>n</inf> − 1)<sup…