A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks
[chapter]

2012
*
Lecture Notes in Computer Science
*

A digraph G = (V, E) with a distinguished set T ⊆ V of terminals is called inner Eulerian if for each v ∈ V − T the numbers of arcs entering and leaving v are equal. By a T -path we mean a simple directed path connecting distinct terminals with all intermediate nodes in V −T . This paper concerns the problem of finding a maximum T -path packing, i.e. a maximum collection of arc-disjoint T -paths. A min-max relation for this problem was established by Lomonosov. The capacitated version was

doi:10.1007/978-3-642-32241-9_10
fatcat:p4ns4uu2nbdj3gv63h2u2alt74