Multi-Commodity Disconnecting Sets

Abstract
A comparison of single-commodity versus multi-commodity networks is provided. Also, two combinatorial algorithms are presented for finding D0, the minimal disconnecting set.

This publication has 0 references indexed in Scilit: