A well-known problem in algorithmic graph theory is the graph isomorphism problem. It consists in con-tructing an algorithm verifying whether two given graphs are isomorphic, i.e., whether it is possible to establish ...
详细信息
A well-known problem in algorithmic graph theory is the graph isomorphism problem. It consists in con-tructing an algorithm verifying whether two given graphs are isomorphic, i.e., whether it is possible to establish a bijective correspondence between the ver-tex sets of these graphs so that it induces a bijective correspondence between their edge sets (in other words, whether the vertices can be labeled so that the labeled graphs coincide).
暂无评论