MaximumIndependentSet
Combinatorica`
Combinatorica`
MaximumIndependentSet
As of Version 10, most of the functionality of the Combinatorica package is built into the Wolfram System. »
MaximumIndependentSet[g]
finds a largest independent set of graph g.
Details and Options
- MaximumIndependentSet functionality is now available in the built-in Wolfram Language function FindIndependentVertexSet.
- To use MaximumIndependentSet, you first need to load the Combinatorica Package using Needs["Combinatorica`"].
Wolfram Research (2012), MaximumIndependentSet, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/MaximumIndependentSet.html.
Text
Wolfram Research (2012), MaximumIndependentSet, Wolfram Language function, https://reference.wolfram.com/language/Combinatorica/ref/MaximumIndependentSet.html.
CMS
Wolfram Language. 2012. "MaximumIndependentSet." Wolfram Language & System Documentation Center. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/MaximumIndependentSet.html.
APA
Wolfram Language. (2012). MaximumIndependentSet. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/Combinatorica/ref/MaximumIndependentSet.html