Check out the new USENIX Web site. next up previous
Next: 5.5.0.0.3 Algorithm: Up: 5.5 Connected components Previous: 5.5.0.0.1 Input:

5.5.0.0.2 Output:
$\bullet$
a connected component $VDC' \subseteq$ $VD$ such that $\forall
vd_{i} \in$ $VDC'$ there $\exists$ at least one $vm_{i}
\in$ $VM$ such that $vmap'(vm_{i}) = vd_{i}$ and $\sum_{\forall
vd_i,vd_j \in VDC'} cost(vde_{i,j})$ is minimum over the set of all possible connected components



Ananth Sundararaj 2004-02-17