Independent set (graph theory)
Semantic Scholar uses AI to extract papers important to this topic.
In this paper, we present a novel scale- and rotation-invariant interest point detector and descriptor, coined SURF (Speeded Up… Expand For several NP-complete problems, there have been a progression of better but still exponential algorithms. In this paper we… Expand A system, method, and apparatus for facilitating a self-organizing workforce of one or more workers through payment and… Expand Unit disk graphs are the intersection graphs of equal sized circles in the plane: they provide a graph-theoretic model for… Expand Introduction to graph theory algorithmic techniques shortest paths trees and acyclic diagraphs depth first search connectivity… Expand A general problem of signal detection in a background of unknown Gaussian noise is addressed, using the techniques of statistical… Expand Simple parallel algorithms for the maximal independent set (MIS) problem are presented. The first algorithm is a Monte Carlo… Expand L. G. Khachiyan recently published a polynomial algorithm to check feasibility of a system of linear inequalities. The method is… Expand Abstract A graph is claw-free if: whenever three (distinct) vertices are joined to a single vertex, those three vertices are a… Expand 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