- 博客(1)
- 收藏
- 关注
RSS订阅原创 Havel定理及其应用
Given a list of n natural numbers d1, d2,...,dn, show how to decide in polynomial time whether there exists an undirected graph G = (V; E) whose node degrees are precisely the numbers d1，d2，...， dn. G
2016-10-22 14:13:28
1337
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人