Filtrer vos résultats
- 5
- 4
- 1
- 5
- 1
- 1
- 1
- 1
- 1
- 5
- 5
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 5
- 5
- 3
- 1
- 1
- 1
- 1
5 résultats
|
|
|
triés par
|
On approximate distance labels and routing schemes with affine stretch$25^{th}$ International Symposium on Distributed Computing (DISC), Sep 2011, Rome, Italy. pp.404-415, ⟨10.1007/978-3-642-24100-0_39⟩
Communication dans un congrès
istex
hal-00651833v1
|
|||
Fully dynamic approximate distance oracles for planar graphs via forbidden-set distance labels44th Annual ACM Symposium on Theory of Computing (STOC), May 2012, New-York, United States. pp.1199-1217, ⟨10.1145/2213977.2214084⟩
Communication dans un congrès
hal-00725839v1
|
|||
On Space-Stretch Trade-Offs: Upper BoundsSymposium on Parallel Algorithms and Architectures (SPAA), 2006, Cambridge, Massachusetts, United States. pp.207-216, ⟨10.1145/1148109.1148144⟩
Communication dans un congrès
hal-00420405v1
|
|||
Strong-Diameter Decompositions of Minor Free Graphs19th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), San Diego, Californie, Etats-Unis, 2007, Jun 2007, San Diego, United States. pp.16-24, ⟨10.1145/1248377.1248381⟩
Communication dans un congrès
hal-00371401v1
|
|||
|
|
Compact Name-Independent Routing with Minimum StretchACM Transactions on Algorithms, 2008, 3 (4), pp.Article 37. ⟨10.1145/1367064.1367077⟩
Article dans une revue
hal-00368010v1
|