NIST

independent set

(definition)

Definition: A set of vertices in a graph such that for any pair of vertices, there is no edge between them.

See also maximal independent set.

Author: SKS

Implementation

(Fortran and C)
Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 2 September 2014.
HTML page formatted Mon Feb 2 13:10:39 2015.

Cite this as:
Sandeep Kumar Shukla, "independent set", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 2 September 2014. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/independentSet.html