摘要:
1122 Hamiltonian Cycle (25 分) 1122 Hamiltonian Cycle (25 分) 1122 Hamiltonian Cycle (25 分) The "Hamilton cycle problem" is to find a simple cycle that 阅读全文
摘要:
1126 Eulerian Path (25 分) 1126 Eulerian Path (25 分) 1126 Eulerian Path (25 分) In graph theory, an Eulerian path is a path in a graph which visits ever 阅读全文
摘要:
1142 Maximal Clique (25 分) 1142 Maximal Clique (25 分) 1142 Maximal Clique (25 分) A clique is a subset of vertices of an undirected graph such that eve 阅读全文