Sciweavers

Share
CPM
2008
Springer

On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices

9 years 2 days ago
On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
Let G be an unweighted and undirected graph of n nodes, and let D be the n
Igor Nitto, Rossano Venturini
Added 19 Oct 2010
Updated 19 Oct 2010
Type Conference
Year 2008
Where CPM
Authors Igor Nitto, Rossano Venturini
Comments (0)
books