2 citations · 4 across the 12 of their papers we have counts for
1 paper · 1 filter
Aleksandar Ilic, Milan Basic
Given a graph G, we associate a path matrix P whose (i,j) entry represents the maximum number of vertex disjoint paths between the vertices i and j, with zeros on the ma…