摘要: The problem of finding a maximum cut an arbitrary graph is one list 21 combinatorial problems (Karp–Cook list). It unknown whether or not there exist algorithms operating in polynomia...
aip.org
sci-hub.se 参考文章(0)
摘要: The problem of finding a maximum cut an arbitrary graph is one list 21 combinatorial problems (Karp–Cook list). It unknown whether or not there exist algorithms operating in polynomia...