SEARCH

SEARCH BY CITATION

Keywords:

  • dynamic network flows;
  • earliest arrival flows;
  • universally maximal dynamic flows;
  • discrete time setting;
  • series-parallel graphs;
  • polynomial algorithms

Abstract

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. © 2010 Wiley Periodicals, Inc. NETWORKS, Vol. 57(2), 169–173 2011