
逼近4正则图的最小顶点覆盖问题的难解性
陈文彬
逼近4正则图的最小顶点覆盖问题的难解性
Hardness of approximating the Minimum Vertex Cover problem for 4-regular graphs
{{custom_ref.label}} |
{{custom_citation.content}}
{{custom_citation.annotation}}
|
/
〈 |
|
〉 |