Skip to main content
Fig. 16 | EURASIP Journal on Advances in Signal Processing

Fig. 16

From: Backtracking-based dynamic programming for resolving transmit ambiguities in WSN localization

Fig. 16

Two child nodes, each with four vertices and two or three different colors, are merged at their parent tree node s. The colors of the vertices correspond to their labels, and the annotated numbers represent the vertex weights. The middle step shows the union of the vertices and edges and is usually omitted in visualizations. At the top, \(\mathcal {G}_{s}\) is the merging result, which contains only two labels. Note that different labels (colors) are used at tree note s compared to at c i (s), i = 1,2. The tables on the right-hand side show the labels used: the top table for the left child \(\mathcal {G}_{c_{1}(s)}\) and the bottom table for the right child. Several label sets are infeasible and thus are assigned a weight of

Back to article page