NIST

maximal independent set

(classic problem)

Definition: A set of vertices in a graph such that for any pair of vertices, there is no edge between them and such that no more vertices can be added and it still be an independent set.

Note: It is NP-complete to decide if there is maximal independent set of size k in a graph.

Author: SKS


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 19 April 2004.
HTML page formatted Fri Feb 23 10:06:08 2018.

Cite this as:
Sandeep Kumar Shukla, "maximal independent set", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 19 April 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/maximalIndependentSet.html