English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
 DetailsSummary
  Fast Algorithms for Maintaining Shortest Paths

Djidjev, H. N., Pantziou, G. E., & Zaroliagis, C. (1995). Fast Algorithms for Maintaining Shortest Paths. In H. Reichel (Ed.), Fundamentals of Computation Theory: 10th International Conference (FCT95) (pp. 191-200). Berlin: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AC82-E Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AC83-C
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Djidjev, Hristo N., Author
Pantziou, Grammati E., Author
Zaroliagis, Christos1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-021995
 Publication Status: Issued
 Pages: -
 Publishing info: Berlin : Springer
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 517710
Other: Local-ID: C1256428004B93B8-269967F5E042AA20C125645A0039918A-Djidjev-Pantziou-Zaro-2-95
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Dresden, Germany
Start-/End Date: 1995

Legal Case

show

Project information

show

Source 1

show
hide
Title: Fundamentals of Computation Theory: 10th International Conference (FCT95)
Source Genre: Proceedings
 Creator(s):
Reichel, Horst, Editor
Affiliations:
-
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 191 - 200 Identifier: -

Source 2

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