RPTU
University Library
Deutsch
Home
Search
Browse
Publish
FAQ
Author(s)
All strings
At least one of the strings
None of the strings
Title
All strings
At least one of the strings
None of the strings
Additional Person(s)
All strings
At least one of the strings
None of the strings
Abstract
All strings
At least one of the strings
None of the strings
Fulltext
All strings
None of the strings
Refine
Author
Ruzika, Stefan
(1)
Sperber, Heike
(1)
Steiner, Mechthild
(1)
Year of publication
2009
(1)
Document Type
Report
(1)
Language
English
(1)
Has Fulltext
yes
(1)
Keywords
discrete time setting (1)
(remove)
Faculty / Organisational entity
Kaiserslautern - Fachbereich Mathematik
(1)
1
search hit
1
to
1
10
10
20
50
100
Earliest Arrival Flows in Series-Parallel Graphs
(2009)
Ruzika, Stefan
;
Sperber, Heike
;
Steiner, Mechthild
We present an exact algorithm for computing an earliest arrival flow in a discrete time setting on series-parallel graphs. In contrast to previous results for the earliest arrival flow problem this algorithm runs in polynomial time.
1
to
1
Sitelinks
|
KLUEDO
Logo ©
Univerity Library of RPTU
,
OPUS
4 ©
KOBV
Login