搜索结果: 1-1 共查到“信息科学与系统科学 paths”相关记录1条 . 查询时间(0.093 秒)
Let G be the base graph with n vertices of any matroid. It is proved that for any two vertices of G there are at least r internally disjoint shortest paths joining them where r is their distance. Furt...