Please use this identifier to cite or link to this item:
|Title:||The maximum edge-disjoint paths problem in bidirected trees|
|Citation:||SIAM JOURNAL ON DISCRETE MATHEMATICS, 2001, 14 (3), pp. 326-355|
|Appears in Collections:||Published Articles, Dept. of Computer Science|
Files in This Item:
There are no files associated with this item.
Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.