1 citations · 3 across the 4 of their papers we have counts for
1 paper · 1 filter
Andrzej Lingas, Dzmitry Sledneu
We consider the problem of computing all-pairs shortest paths in a directed graph with real weights assigned to vertices. For an n×n 0-1 matrix C, let KC be the comp…