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 15 July 2019.
HTML page formatted Mon Jul 15 12:55:43 2019.

Cite this as:
Sandeep Kumar Shukla, "independent set", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 15 July 2019. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/independentSet.html