A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Theoretical and computational advances for network diversion

2013
*
Networks
*

The network-diversion problem (ND) is defined on a directed or undirected graph G = (V , E ) having nonnegative edge weights, a source vertex s, a sink vertex t , and a "diversion edge" e . This problem, with intelligence-gathering and war-fighting applications, seeks a minimum-weight, minimal s-t cut E C ⊆ E in G such that e ∈ E C . We present (a) a new NP-completeness proof for ND on directed graphs, (b) the first polynomialtime solution algorithm for a special graph topology, (c) an improved

doi:10.1002/net.21514
fatcat:gmabxdmfj5hbje56uiuk5ox2de