English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  All-Pairs Shortest-Paths Computation in the Presence of Negative Cycles

Mehlhorn, K., Priebe, V., Schäfer, G., & Sivadasan, N. (2002). All-Pairs Shortest-Paths Computation in the Presence of Negative Cycles. Information Processing Letters, 81, 341-343.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Mehlhorn, Kurt1, Author           
Priebe, Volker1, Author           
Schäfer, Guido1, Author           
Sivadasan, Naveen1, Author           
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2003-09-082002
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 202096
Other: Local-ID: C1256428004B93B8-8344AA818D3EAAF0C1256D0800462AB0-MPSS2002
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Information Processing Letters
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 81 Sequence Number: - Start / End Page: 341 - 343 Identifier: -