CIKM
2010
Springer
13 years 5 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
WIOPT
2006
IEEE
14 years 26 days ago
2006
IEEE
— We introduce and discuss a novel link model that incorporates both uncertainty in the fading coefficients and the node distances for ad hoc networks with randomly placed nodes...