Abstract
For a given number L, an L-length-bounded edge-cut in a graph G with source s and sink t is a set C of edges such that no s-t-path of length at most L remains in the graph after removing the edges in C.
For a given number L, an L-length-bounded edge-cut in a graph G with source s and sink t is a set C of edges such that no s-t-path of length at most L remains in the graph after removing the edges in C.