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

14 years 1 months ago

Let G be an unweighted and undirected graph of n nodes, and let D be the n

Igor Nitto, Rossano Venturini

All-Pairs-Shortest-Path Distances | Combinatorics | CPM 2008 | Simple Counting Argument | Undirected Graph |

claim paper

Added	19 Oct 2010
Updated	19 Oct 2010
Type	Conference
Year	2008
Where	CPM
Authors	Igor Nitto, Rossano Venturini

Comments (0)