Logo NGI
nl
en
Zoeken

infrabase >

publicaties >

the weight and hopcount of the shortest path in the complete graph with exponential weights

Titel
The weight and hopcount of the shortest path in the complete graph with exponential weights
Type
artikel vakblad
Referentie

Hooghiemstra, G. and P. Van Mieghem, 2008, "The weight and hopcount of the shortest path in the complete graph with exponential weights", Combinatorics, Probability and Computing, Vol. 17, No. 4, pp. 537-548.

Projecten
Physics of complex networks

Logo NGI

Bouwcampus
Van der Burghweg 1
2628 CS Delft
secretariaat@nginfra.nl
telefoon: 015 303 0900

© 2016 Next Generation Infrastructures