发表评论

Shortest (A+B)-path packing via hafnian. (arXiv:1603.08073v2 [math.CO] UPDATED)

来源于:arXiv
Bj\"orklund and Husfeldt developed a randomized polynomial time algorithm to solve the shortest two disjoint paths problem. Their algorithm is based on computation of permanents modulo 4 and the isola

发表评论

用户名:   登录|注册账号
标题:
评论:
使用预览按钮!检查错误!引用添加:[quote][/quote] 链接添加:[url][/url]