The mapping problem has been shown to be computationally equivalent to the graph isomorphism problem; as such it is unlikely that a polynomial time algosrithm exists for its solution. Practical algorithms of general a...
详细信息
The mapping problem has been shown to be computationally equivalent to the graph isomorphism problem; as such it is unlikely that a polynomial time algosrithm exists for its solution. Practical algorithms of general applicability and low computational complexity have not been found and are unlikely to appear.
暂无评论