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.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 2 November 2020.
HTML page formatted Mon Nov 2 12:36:42 2020.
Cite this as:
Sandeep Kumar Shukla, "independent set", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 2 November 2020. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/independentSet.html