Χ
With visiting this site I accept that it uses cookies for website analytics.
Learn more
UNIVERSITÄTSBIBLIOTHEK
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
Steiner, Mechthild (1)
(remove)
Document Type
Report (1)
(remove)
Keywords
discrete time setting
(1)
dynamic network flows
(1)
earliest arrival flows
(1)
polynomial algorithms
(1)
seriesparallel graphs
(1)
1
search hit
1
to
1
10
10
20
50
100
Earliest Arrival Flows in SeriesParallel 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 seriesparallel graphs. In contrast to previous results for the earliest arrival flow problem this algorithm runs in polynomial time.
1
to
1
Sitelinks

KLUEDO
Logo ©
UB Kaiserslautern
,
OPUS
4 ©
KOBV
Login