Sciweavers

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

9

CPC
2008

favoriteEmaildiscussreport

63views more CPC 2008»

The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights

13 years 4 months ago

The Weight and Hopcount of the Shortest Path in the Complete Graph with Exponential Weights

Download www.nas.its.tudelft.nl

Gerard Hooghiemstra, Piet Van Mieghem

Real-time Traffic

CPC 2008 |

claim paper

Related Content

» Size and Weight of Shortest Path Trees with Exponential Link Weights

» Weight of a link in a shortest path tree and the Dedekind Eta function

» The Longest MinimumWeight Path in a Complete Graph

» AverageCase Analyses of Vickrey Costs

» Minimizing Average Shortest Path Distances via Shortcut Edge Addition

» The FloydWarshall algorithm on graphs with negative cycles

» A new approach to dynamic all pairs shortest paths

» Maintenance of Multilevel Overlay Graphs for Timetable Queries

» Formal Language Constrained Path Problems

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	CPC
Authors	Gerard Hooghiemstra, Piet Van Mieghem

Comments (0)