In its former formulation, the problem was proved to be NP-complete by Orlin (1977), even for bipartite graphs.
Ovaj problem je dokazan da je NP-kompletan od strane Orlina (Orlin 1977), čak i za bipartitne grafove.