1
$\begingroup$

Is there a similar theorem to max flow min cut for finding max flow in a digraph where edges are colored red and blue, and the flow is required to alternate between red and blue edges? I may also allow the assumption that the source only has red out-edges and the sink only has blue in-edges.

$\endgroup$
1
$\begingroup$

I realised that you can apply max flow min cut to the graph where you have two copies of each vertex from the original graph: the first one has only red out-edges and blue in-edges, while the second one has blue out-edges and red in-edges.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.