Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 227,741,317 papers from all fields of science
Search
Sign In
Create Free Account
Independent set (graph theory)
Known as:
Vertex independent set
, Vertex packing
, Coclique
Expand
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
APX
Algorithmica
Baker's technique
Brute-force search
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Mitigation of linear and nonlinear impairments in high-speed optical networks by using LDPC-coded turbo equalization
I. Djordjevic
,
L. Minkov
,
H. Batshon
IEEE Journal on Selected Areas in Communications
2008
Corpus ID: 6123274
We study a turbo equalization scheme based on low-density parity-check (LDPC) coded turbo equalization (TE). This scheme is…
Expand
2007
2007
Improved algorithms for weakly chordal graphs
R. Hayward
,
J. Spinrad
,
R. Sritharan
TALG
2007
Corpus ID: 15609654
We use a new structural theorem on the presence of two-pairs in weakly chordal graphs to develop improved algorithms. For the…
Expand
2006
2006
Fourth-order structural steganalysis and analysis of cover assumptions
Andrew D. Ker
Electronic imaging
2006
Corpus ID: 15324435
We extend our previous work on structural steganalysis of LSB replacement in digital images, building detectors which analyse the…
Expand
Highly Cited
1991
Highly Cited
1991
Efficient reconfiguration algorithms for degradable VLSI/WSI arrays
S. Kuo
,
Ing-Yi Chen
Proceedings, International Conference on Wafer…
1991
Corpus ID: 3045412
A systematic method for reconfiguration in VLSI/WSI (wafer scale integration) arrays using the degradation approach for yield…
Expand
Highly Cited
1988
Highly Cited
1988
Over-the-cell channel routing
J. Cong
,
C. Liu
[] IEEE International Conference on Computer…
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…
Expand
Highly Cited
1986
Highly Cited
1986
An O(20.304n) Algorithm for Solving Maximum Independent Set Problem
Tang Jian
IEEE Trans. Computers
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…
Expand
Highly Cited
1986
Highly Cited
1986
Human T-cell γ genes contain N segments and have marked junctional variability
T. Quertermous
,
W. Strauss
,
C. Murre
,
D. Dialynas
,
J. Strominger
,
J. G. Seidman
Nature
1986
Corpus ID: 4336119
The γ-chain genes are encoded by immunoglobulin-like gene segments in germline DNA which rearrange during the somatic development…
Expand
Highly Cited
1984
Highly Cited
1984
PREDICTING PINUS RADIATA SITE INDEX FROM ENVIRONMENTAL VARIABLES
I. Hunter
,
A. R. Gibson
1984
Corpus ID: 132104286
Two hundred and ninety-nine plots of Pinus radiata D. Don in forests throughout the North Island of New Zealand were sampled. At…
Expand
Highly Cited
1982
Highly Cited
1982
Some facets of the simple plant location polytope
G. Cornuéjols
,
J. Thizy
Mathematical programming
1982
Corpus ID: 33429267
We relate the simple plant location problem to the vertex packing problem and derive several classes of facets of their…
Expand
1977
1977
Discrete-time single server queues with correlated inputs
B. Gopinath
,
J. Morrison
Bell Labs technical journal
1977
Corpus ID: 30741931
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…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE