@inproceedings{7f0b0245962849acae597b5374dad647,
title = "Brief announcement: On augmented graph navigability",
abstract = "It is known that graphs of doubling dimension O(log log n) can be augmented to become navigable. We show that for doubling dimension ≫ log log n, an infinite family of graphs cannot be augmented to become navigable. Our proof uses a counting argument which enable us to consider any kind of augmentations. In particular we do not restrict our analysis to the case of symmetric distributions, nor to distributions for which the choice of the long range link at a node must be independent from the choices of long range links at other nodes.",
author = "Pierre Fraigniaud and Emmanuelle Lebhar and Zvi Lotker",
year = "2006",
doi = "10.1007/11864219_42",
language = "אנגלית",
isbn = "3540446249",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "551--553",
booktitle = "Distributed Computing - 20th International Symposium, DISC 2006, Proceedings",
address = "גרמניה",
note = "20th International Symposium on Distributed Computing, DISC 2006 ; Conference date: 18-09-2006 Through 20-09-2006",
}