组合爆炸

来源: jinjing 于 2010-04-14 17:53:40 [] [旧帖] [给我悄悄话] 阅读数 : (136 bytes)

1,不是首尾相连called Euler path.
2,I think we can only get bound for big N.
3,For Complete Graph we can get Halmilton path easily.

所有跟帖： 

• Hamilton path vs. Euler path -aisanguo- ♀ 给 aisanguo 发送悄悄话 aisanguo 的博客首页 (290 bytes) () 04/15/2010 postreply 06:07:22

• 回复：Hamilton path vs. Euler path -jinjing- ♀ 给 jinjing 发送悄悄话 (647 bytes) () 04/15/2010 postreply 07:20:09

• I'm sorry for typing ; thang for thank,Erler for Euler -jinjing- ♀ 给 jinjing 发送悄悄话 (115 bytes) () 04/15/2010 postreply 08:13:18

请您先登陆，再发跟帖！