Figure 5

Neighborhood search from a single node v (green) to its neighbors. Color indicates C(v _i ) ≥ 0 and gray nodes indicate C(v _i ) = -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 G _c showing only edges incident on v.