UNIVERSITÄTSBIBLIOTHEK
  • search hit 1 of 1
Back to Result List

Earliest Arrival Flows in Series-Parallel Graphs

  • 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.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Metadaten
Author:Stefan Ruzika, Heike Sperber, Mechthild Steiner
URN (permanent link):urn:nbn:de:hbz:386-kluedo-16150
Serie (Series number):Report in Wirtschaftsmathematik (WIMA Report) (122)
Document Type:Report
Language of publication:English
Year of Completion:2009
Year of Publication:2009
Publishing Institute:Technische Universität Kaiserslautern
Date of the Publication (Server):2009/10/06
Tag:discrete time setting; dynamic network flows; earliest arrival flows; polynomial algorithms; series-parallel graphs
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:5 Naturwissenschaften und Mathematik / 510 Mathematik
Licence (German):Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011