Korteste Veje i Planare Grafer med Reelle Kantvægte i O(n(log n)^2/loglog n) Tid

Publikation: Working paper › Forskning

Standard

Korteste Veje i Planare Grafer med Reelle Kantvægte i O(n(log n)^2/loglog n) Tid. / Wulff-Nilsen, Christian.

Datalogisk Institut, Københavns Universitet (DIKU), 2009.

Publikation: Working paper › Forskning

Harvard

Wulff-Nilsen, C 2009 'Korteste Veje i Planare Grafer med Reelle Kantvægte i O(n(log n)^2/loglog n) Tid' Datalogisk Institut, Københavns Universitet (DIKU).

APA

Wulff-Nilsen, C. (2009). Korteste Veje i Planare Grafer med Reelle Kantvægte i O(n(log n)^2/loglog n) Tid.

Vancouver

Wulff-Nilsen C. Korteste Veje i Planare Grafer med Reelle Kantvægte i O(n(log n)^2/loglog n) Tid. Datalogisk Institut, Københavns Universitet (DIKU). 2009.

Author

Wulff-Nilsen, Christian. / Korteste Veje i Planare Grafer med Reelle Kantvægte i O(n(log n)^2/loglog n) Tid. Datalogisk Institut, Københavns Universitet (DIKU), 2009.

Bibtex

@techreport{0732552065a211de8bc9000ea68e967b,
title = "Korteste Veje i Planare Grafer med Reelle Kantv{\ae}gte i O(n(log n)^2/loglog n) Tid",
abstract = "Given an n-vertex planar directed graph with real edge lengths and with no negative cycles, we show how to compute single-source shortest path distances in the graph in O(n(log n)^2/loglog n) time with O(n) space. This is an improvement of a recent time bound of O(n(log n)^2) by Klein et al.",
author = "Christian Wulff-Nilsen",
year = "2009",
language = "English",
type = "WorkingPaper",

}

RIS

TY - UNPB

T1 - Korteste Veje i Planare Grafer med Reelle Kantvægte i O(n(log n)^2/loglog n) Tid

AU - Wulff-Nilsen, Christian

PY - 2009

Y1 - 2009

N2 - Given an n-vertex planar directed graph with real edge lengths and with no negative cycles, we show how to compute single-source shortest path distances in the graph in O(n(log n)^2/loglog n) time with O(n) space. This is an improvement of a recent time bound of O(n(log n)^2) by Klein et al.

AB - Given an n-vertex planar directed graph with real edge lengths and with no negative cycles, we show how to compute single-source shortest path distances in the graph in O(n(log n)^2/loglog n) time with O(n) space. This is an improvement of a recent time bound of O(n(log n)^2) by Klein et al.

M3 - Working paper

BT - Korteste Veje i Planare Grafer med Reelle Kantvægte i O(n(log n)^2/loglog n) Tid

CY - Datalogisk Institut, Københavns Universitet (DIKU)

ER -

ID: 12874166