| Article ID: | iaor20073069 |
| Country: | Netherlands |
| Volume: | 35 |
| Issue: | 1 |
| Start Page Number: | 10 |
| End Page Number: | 16 |
| Publication Date: | Jan 2007 |
| Journal: | Operations Research Letters |
| Authors: | Nguyen Thnh |
| Keywords: | graphs |
Using flow and matching algorithms to solve the problem of finding disjoint paths through a given node, and with a technique of Chekuri and Khanna, we give an O(√(