English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
  Average Update Times for Fully-Dynamic All-Pairs Shortest Paths.

Friedrich, T., & Hebbinghaus, N. (2008). Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. In S.-H. Hong, H. Nagamochi, & T. Fukunaga (Eds.), Algorithms and Computation: 19th International Symposium, (pp. 693-704). New York, NY: Springer.

Item is

Files

show Files

Locators

show

Creators

hide
 Creators:
Friedrich, Tobias1, Author           
Hebbinghaus, Nils1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

hide
Language(s): eng - English
 Dates: 2009-03-242008
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 428077
DOI: 10.1007/978-3-540-92182-0_61
URI: http://dx.doi.org/10.1007/978-3-540-92182-0_61
Other: Local-ID: C125756E0038A185-D90AB617C945DBF9C1257559004CB614-FH08
 Degree: -

Event

hide
Title: 19th International Symposium on Algorithms and Computation
Place of Event: Gold Coast, Australia
Start-/End Date: 2009-02-10 - 2009-02-10

Legal Case

show

Project information

show

Source 1

hide
Title: Algorithms and Computation : 19th International Symposium,
  Abbreviation : ISAAC 2008
  Subtitle : 19th International Symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings
Source Genre: Proceedings
 Creator(s):
Hong, Seok-Hee1, Editor
Nagamochi, Hiroshi1, Editor
Fukunaga, Takuro1, Editor
Affiliations:
1 External Organizations, ou_persistent22            
Publ. Info: New York, NY : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 693 - 704 Identifier: ISBN: 978-3-540-92181-3

Source 2

hide
Title: Lecture Notes in Computer Science
  Abbreviation : LNCS
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 5369 Sequence Number: - Start / End Page: - Identifier: -