Das Knotenüberdeckungsproblem - Eine Fallstudie zur Didaktik NP-schwerer Probleme (Teil 1)
暂无分享，去创建一个
[1] Steven Skiena,et al. The Algorithm Design Manual , 2020, Texts in Computer Science.
[2] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .