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

Authorsجواد طیبی، حمید بیگدلی
Conference Titleششمین کنفرانس ترکیبیات رمز و محاسبات
Holding Date of Conferenceآبان 1400
PresentationSPEECH
Conference LevelInternational Conferences

Abstract