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.

Export metadata

  • Export Bibtex
  • Export RIS

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
Tag:discrete time setting; dynamic network flows; earliest arrival flows; polynomial algorithms; series-parallel graphs
Faculties / Organisational entities:Fachbereich Mathematik
DDC-Cassification:510 Mathematik

$Rev: 12793 $