Special case of max-flow based algo. Complexity. n-1 Steiner min-cut computations ... (mn) algo for cut tree construction. 9. Cole-Hariharan Steiner min-cut algorithm ...
Assume N to be a directional graph. Let every arc have an associated positive integer c called the ... sets (X Y, X ~Y, ~X Y, ~X ~Y) contains at lest one node. ...