Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
In this paper, we present a novel scale- and rotation-invariant interest point detector and descriptor, coined SURF (Speeded Up… Expand
  • figure 1
  • figure 2
Highly Cited
1998
Highly Cited
1998
For several NP-complete problems, there have been a progression of better but still exponential algorithms. In this paper we… Expand
Highly Cited
1991
Highly Cited
1991
A system, method, and apparatus for facilitating a self-organizing workforce of one or more workers through payment and… Expand
Highly Cited
1990
Highly Cited
1990
Unit disk graphs are the intersection graphs of equal sized circles in the plane: they provide a graph-theoretic model for… Expand
Highly Cited
1989
Highly Cited
1989
Introduction to graph theory algorithmic techniques shortest paths trees and acyclic diagraphs depth first search connectivity… Expand
  • figure 1-2
  • figure 1-3
  • figure 1-4
  • figure 1-5
  • figure 1-6
Highly Cited
1986
Highly Cited
1986
  • E. J. Kelly
  • IEEE Transactions on Aerospace and Electronic…
  • 1986
  • Corpus ID: 33255354
A general problem of signal detection in a background of unknown Gaussian noise is addressed, using the techniques of statistical… Expand
  • figure 4
  • figure 1
  • figure 8
  • figure 5
Highly Cited
1985
Highly Cited
1985
  • M. Luby
  • STOC '85
  • 1985
  • Corpus ID: 1126858
Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo… Expand
Highly Cited
1981
Highly Cited
1981
L. G. Khachiyan recently published a polynomial algorithm to check feasibility of a system of linear inequalities. The method is… Expand
Highly Cited
1980
Highly Cited
1980
  • G. Minty
  • J. Comb. Theory, Ser. B
  • 1980
  • Corpus ID: 28337407
Abstract A graph is claw-free if: whenever three (distinct) vertices are joined to a single vertex, those three vertices are a… Expand
  • figure I
  • figure 2
  • figure 3
  • figure 5
Highly Cited
1978
Highly Cited
1978
LetN be a finite set andz be a real-valued function defined on the set of subsets ofN that satisfies z(S)+z(T)≥z(S⋃T)+z(S⋂T) for… Expand