ArticlesMulticuts in Unweighted Digraphs with Bounded Degree and Bounded Tree-Width
References (5)
- et al.
“Approximation Algorithms for Steiner and Directed Multicuts,”
Journal of Algorithms
(1997) - G. Cǎlinescu, C.G. Fernandes and B. Reed, “Multicuts in Unweighted Graphs with Bounded Degree and Bounded Tree-Width.”...
There are more references available in the full text version of this article.
Cited by (1)
- 1
Supported partially by FAPESP Proc. 98-14329-2 and PRONEX 107/97.
Copyright © 2005 Elsevier Ltd. All rights reserved.