Improved bounds for shortest paths in dense distance graphs

Gawrychowski, Paweł; Karczmarz, Adam

Przejdź do menu głównego Przejdź do wyszukiwarki Przejdź do zawartości

polski
English

Home page
Improved bounds for shortest paths in dense distance graphs

Description

Title: Improved bounds for shortest paths in dense distance graphs
Group publication title: LIPIcs ; 107
Collective work title: 45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)
Creator: Gawrychowski, Paweł ; Karczmarz, Adam
Pages: S. 61
Publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Place of publishing: Wadern
Date issued: 2018
Type: Tekst
Identifier: ISBN 9783959770767 ; https://doi.org/10.4230/LIPIcs.ICALP.2018.61
Language: eng
Has version: https://doi.org/10.4230/LIPIcs.ICALP.2018.61
License: CC BY
Detailed object type: rozdz
Object type: Rozdział

The build of the Digital Demonstration Library was commissioned by the Name of the Institution of the Foundation's Institution. The Name of the Foundation under the Program, the Library Project and its creation under the patronage of the Name of the Institution.

Europejski Fundusz Rozwoju Regionalnego Unii Europejskiej

The project titled "Workflow to develop digital publications at the university" co-financed by the European Union from the European Regional Development Fund.

We use files, through the cookie quality improvement layer of our website.For more information, please read the document Privacy Policy