Abstract
Given a graph G, we associate to it a path matrix P whose (i, j) entry represents the maximum number of vertex disjoint paths between the vertices i a......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
