Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

CPM
2008
Springer

favoriteEmaildiscussreport

149views Combinatorics» more CPM 2008»

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

13 years 6 months ago

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

Download hpc.isti.cnr.it

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

Igor Nitto, Rossano Venturini

Real-time Traffic

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

claim paper

Related Content

» Beyond SVD Sparse projections onto exemplar orthonormal bases for compact image representa...

» Compact Representation of Multidimensional Data Using Tensor RankOne Decomposition

» Stable and compact inductance modeling of 3D interconnect structures

» A Systematic Evaluation of Compact Hardware Implementations for the Rijndael SBox

» Compact and stable modeling of partial inductance and reluctance matrices

» A Fast Augmented Lagrangian Algorithm for Learning LowRank Matrices

» Passive Synthesis of Compact FrequencyDependent Interconnect Models via Quadrature Spectra...

» Computing Optimal Policies for Partially Observable Decision Processes Using Compact Repre...

» Algorithms for Three Versions of the Shortest Common Superstring Problem

Post Info
More Details (n/a)

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

Comments (0)