A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
· Georg Baier et al. For a given number L, an L-length-bounded edge-cut (node-cut, resp.) in a graph G with source s and sink t is a set C of edges (nodes, resp.) such that no s-t-path of length at most L remains in the graph after removing the edges (nodes, resp.) in C. An L-length-bounded flow is a flow that can be decomposed into flow paths of length at most L. In contrast to the classical flow theory, we describe instances for which the minimum L-length-bounded edge-cut (node-cut, resp.) isdoi:10.1007/11786986_59 fatcat:brgpjys3mfhedmxtbgsrlxon5y