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.
更多信息和选项
- 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 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/MaximumIndependentSet.html.
文本
Wolfram Research (2012)，MaximumIndependentSet，Wolfram 语言函数，https://reference.wolfram.com/language/Combinatorica/ref/MaximumIndependentSet.html.
CMS
Wolfram 语言. 2012. "MaximumIndependentSet." Wolfram 语言与系统参考资料中心. Wolfram Research. https://reference.wolfram.com/language/Combinatorica/ref/MaximumIndependentSet.html.
APA
Wolfram 语言. (2012). MaximumIndependentSet. Wolfram 语言与系统参考资料中心. 追溯自 https://reference.wolfram.com/language/Combinatorica/ref/MaximumIndependentSet.html 年