Special Minimum Cuts in Directed Graphs NOTE

Abstract

The purpose of this paper is to solve the odd minimum \(S\)-cut, the odd minimum \(\bar{T}\)-cut, and the odd minimum \((S, T)\)-cut problems in directed graphs using triple families. We also provide here two properties of triple families.