本周進(jìn)度:
選擇性閱讀精讀論文時(shí)文中提到的參考文獻(xiàn)
A quick method for finding shortest pairs of disjoint paths
Two algorithms for connected r-hop k
Graph Theory (Adrian Bondy, U.S.R. Murty)
將用到的關(guān)鍵方法和引理總結(jié)為一篇word文檔
遇到問題:無
下周目標(biāo):
繼續(xù)閱讀其他參考文獻(xiàn)并準(zhǔn)備匯報(bào)