Earliest arrival flows on series-parallel graphs

Stefan Ruzika, Heike Sperber, Mechthild Steiner
<span title="2011-02-11">2011</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/p4qgtym3grdnngfxilwqjjxqy4" style="color: black;">Networks</a> </i> &nbsp;
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.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/net.20398">doi:10.1002/net.20398</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ctr4moxz5vc2ro3kyow2nvyipy">fatcat:ctr4moxz5vc2ro3kyow2nvyipy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808015348/https://kluedo.ub.uni-kl.de/frontdoor/deliver/index/docId/2137/file/Earliest_Arrival_Flows_on_series-parallel_graphs.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7a/b9/7ab9de29bd099dec396cfd3855f2c43eca67872e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/net.20398"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a>