組合爆炸

來源: 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

請您先登陸，再發跟帖！