Sciweavers

MP
2006
84views more  MP 2006»
13 years 11 months ago
Optimal 3-terminal cuts and linear programming
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
Kevin K. H. Cheung, William H. Cunningham, Lawrenc...