(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
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 17 December 2004.
HTML page formatted Tue Dec 6 16:16:32 2011.
Cite this as:
Sandeep Kumar Shukla, "independent set", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 17 December 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/independentSet.html