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.
Highly Cited
2012
Highly Cited
2012
Independent sets in hypergraphs
Many important theorems and conjectures in combinatorics, such as the the- orem of Szemeredi on arithmetic progressions and the… 
Highly Cited
2008
Highly Cited
2008
Fast Analysis of Large Antenna Arrays Using the Characteristic Basis Function Method and the Adaptive Cross Approximation Algorithm
The characteristic basis function method (CBFM) has been hybridized with the adaptive cross approximation (ACA) algorithm to… 
Highly Cited
2007
Highly Cited
2007
Matroids, secretary problems, and online mechanisms
We study a generalization of the classical secretary problem which we call the "matroid secretary problem". In this problem, the… 
Highly Cited
2006
Highly Cited
2006
Minimum connected dominating sets and maximal independent sets in unit disk graphs
Highly Cited
2003
Highly Cited
2003
Dry Bias and Variability in Vaisala RS80-H Radiosondes: The ARM Experience
Thousands of comparisons between total precipitable water vapor (PWV) obtained from radiosonde (Vaisala RS80-H) profiles and PWV… 
Highly Cited
2001
Highly Cited
2001
SNPs Problems, Complexity, and Algorithms
Single nucleotide polymorphisms (SNPs) are the most frequent form of human genetic variation. They are of fundamental importance… 
Highly Cited
1999
Highly Cited
1999
A new version of ant system for subset problems
Early applications of Ant Colony Optimization (ACO) have been mainly concerned with solving ordering problems (e.g., traveling… 
Highly Cited
1996
Highly Cited
1996
A Column Generation Approach for Graph Coloring
We present a method for solving the independent set formulation of the graph coloring problem (where there is one variable for… 
Highly Cited
1989
Highly Cited
1989
The boolean quadric polytope: Some characteristics, facets and relatives
We study unconstrained quadratic zero–one programming problems havingn variables from a polyhedral point of view by considering… 
Highly Cited
1974
Highly Cited
1974
Properties of vertex packing and independence system polyhedra
AbstractWe consider two convex polyhedra related to the vertex packing problem for a finite, undirected, loopless graphG with no… 
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)