English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs

Arge, L., Meyer, U., & Toma, L. (2004). External Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs. In Automata, languages and programming: 31st International Colloquium, ICALP 2004 (pp. 146-157). Berlin, Germany: Springer.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2A9A-8 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-000F-2A9C-4
Genre: Conference Paper

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Arge, Lars, Author
Meyer, Ulrich1, Author           
Toma, Laura, Author
Diaz, Josep, Editor
Karhumäki, Juhani, Editor
Lepistö, Arto, Editor
Sannella, Donald, Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2005-05-012004
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 232074
Other: Local-ID: C1256428004B93B8-508989DACF6C2B94C1256F87003637B2-ArMeTo04
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Turku, Finland
Start-/End Date: 2004-07-12

Legal Case

show

Project information

show

Source 1

show
hide
Title: Automata, languages and programming : 31st International Colloquium, ICALP 2004
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 146 - 157 Identifier: -

Source 2

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