Neighborhood search from a single node v (green) to its neighbors. Color indicates C(vi) ≥ 0 and gray nodes indicate C(vi) = -1. (a) The local neighborhood includes all nodes reachable from v, bounded by nodes with a positive color value. (b) The resulting paths computed using a shortest-path search. (c) The core connectivity graph Gc showing only edges incident on v.
Mayerich et al. BMC Bioinformatics 2012 13(Suppl 8):S7 doi:10.1186/1471-2105-13-S8-S7