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

Fig. 6

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

Fig. 6

Examples of k-ambiguity trees. a shows a part of a tree in which the tree nodes consist of the merging operator μ. This visualization is analogous to the general description of clique-width k-expression trees, in which the annotated ambiguity subgraphs \(\mathcal {G}\) are often referred to as bags. b shows the same tree, with the tree nodes—for clarity—replaced by the corresponding labeled ambiguity subgraphs

Back to article page
\