English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka

Mehlhorn, K., & Priebe, V. (1995). On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka. In Algorithms - ESA'95: 3rd Annual European Symposium (pp. 185-198). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AC43-D Version Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AC44-B
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Mehlhorn, Kurt1, Author           
Priebe, Volker1, Author           
Spirakis, Paul1, Editor           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2006-08-231995
 Publication Status: Issued
 Pages: -
 Publishing info: Berlin, Germany : Springer
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 344417
Other: Local-ID: C1256428004B93B8-95BD0CCD6D014E28C125645A004E08DF-Mehlhorn-Priebe95
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Corfu, Greece
Start-/End Date: 1995-09-25

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithms - ESA'95: 3rd Annual European Symposium
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 185 - 198 Identifier: ISBN: 3-540-60313-1

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: -