Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization

Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization

Content
Grafik
Additional Information

https://arxiv.org/abs/1308.0776

Grafik Top
Authors
  • Henzinger, Monika
  • Krinninger, Sebastian
  • Nanongkai, Danupon
Grafik Top
Shortfacts
Category
 Journal Paper
Divisions
 Theory and Applications of Algorithms
Subjects
 Datenstrukturen
Theoretische Informatik
Journal or Publication Title
 SIAM Journal on Computing
ISSN
 0097-5397
Page Range
 pp. 947-1006
Number
 3
Volume
 45
Date
 June 2016
Export
Grafik Top
Universität Wien| Fakultät für Informatik | Währinger Straße 29 | 1090 Wien | T +43-1-4277-780 01 | Imprint | Webteam
EPrints Logo
CS is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.