A strongly polynomial-time algorithm to minimum st-cut interdiction problems on planar networks

چکیده مقاله