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)

Related topics

Related topics

50 relations
APXAlgorithmicaBaker's techniqueBrute-force search

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Moment Invariants for 2D Flow Fields Using Normalization
The analysis of 2D flow data is often guided by the search for characteristic structures with semantic meaning. One way to… 
Highly Cited
2010
Highly Cited
2010
Scheduling in wireless ad hoc networks with successive interference cancellation
Successive interference cancellation (SIC) is an effective way of multipacket reception (MPR) to combat interference in wireless… 
2009
2009
Re-ranking search results using language models of query-specific clusters
  • Oren Kurland
  • Information retrieval (Boston)
  • 2009
  • Corpus ID: 8681118
To obtain high precision at top ranks by a search performed in response to a query, researchers have proposed a cluster-based re… 
2007
2007
Improved algorithms for weakly chordal graphs
We use a new structural theorem on the presence of two-pairs in weakly chordal graphs to develop improved algorithms. For the… 
2006
2006
Fourth-order structural steganalysis and analysis of cover assumptions
We extend our previous work on structural steganalysis of LSB replacement in digital images, building detectors which analyse the… 
2006
2006
Post-Routing Redundant Via Insertion and Line End Extension with Via Density Consideration
Redundant via insertion and line end extension employed in the post-routing stage are two well known and highly recommended… 
Highly Cited
1988
Highly Cited
1988
An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
A new algorithm is presented for finding a maximum independent set of a circular-arc graph. When the graph is given in the form… 
Highly Cited
1986
Highly Cited
1986
Human T-cell γ genes contain N segments and have marked junctional variability
The γ-chain genes are encoded by immunoglobulin-like gene segments in germline DNA which rearrange during the somatic development… 
1977
1977
Discrete-time single server queues with correlated inputs
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… 
1977
1977
The microprogramming of pipelined processors
A pipelined processor is one whose computational capabilities are divided into several sequential stages, each of which may be… 
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)