English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Fully dynamic all-pairs shortest paths with worst-case update-time

Abraham, I., Chechik, S., & Krinninger, S. (2017). Fully dynamic all-pairs shortest paths with worst-case update-time. In P. N. Klein (Ed.), Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 440-452). Philadelphia, PA: SIAM. doi:10.1137/1.9781611974782.28.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Abraham, Ittai1, Author
Chechik, Shiri1, Author
Krinninger, Sebastian2, Author           
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20172017
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: DOI: 10.1137/1.9781611974782.28
BibTex Citekey: AbrahamCK17
 Degree: -

Event

show
hide
Title: Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
Place of Event: Barcelona, Spain
Start-/End Date: 2017-01-16 - 2017-01-19

Legal Case

show

Project information

show

Source 1

show
hide
Title: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
  Abbreviation : SODA 2017
Source Genre: Proceedings
 Creator(s):
Klein, Philip N.1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: Philadelphia, PA : SIAM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 440 - 452 Identifier: ISBN: 978-1-61197-478-2