本周进度:
选择性阅读精读论文时文中提到的参考文献
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)
将用到的关键方法和引理总结为一篇word文档
遇到问题:无
下周目标:
继续阅读其他参考文献并准备汇报
本周进度:
选择性阅读精读论文时文中提到的参考文献
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)
将用到的关键方法和引理总结为一篇word文档
遇到问题:无
下周目标:
继续阅读其他参考文献并准备汇报