关于Havel算法判断度数序列能否构成简单图的思考
原网址:
http://blog.csdn.net/xanxus46/article/details/41360619
问题描述:
Given a list of n natural numbers d1, d2,...,dn, show how to decide in polynomial time whether there exists
an undirected
转载
2015-01-04 17:11:41 ·
836 阅读 ·
0 评论