Multi-Commodity Disconnecting Sets
M. Bellmore, H. J. Geenberg, J. J. Jarvis
Management Science · 1970 · Volume 16 · Issue 6
Abstract
A comparison of single-commodity versus multi-commodity networks is provided. Also, two combinatorial algorithms are presented for finding D 0 , the minimal disconnecting set.
Enable JavaScript for citation tools and additional paper interactions.