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