Skip to main content

Table 3 Vertices’ clique memberships for the example in Fig. 14

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

  v 1 v 2 v 3 v 4 v 5 v 6 v 8 v 9
\(\mathcal {G}_{1,a} \) \(\mathcal {C}_{7}\) \(\mathcal {C}_{7}\) \(\mathcal {C}_{8}\) \(\mathcal {C}_{8}\) \( \mathcal {C}_{8}\) \(\mathcal {C}_{7}\) \(\mathcal {C}_{8}\) \(\mathcal {C}_{7}\)
\(\mathcal {G}_{1,b}\) \(\mathcal {C}_{5} \) \(\mathcal {C}_{5}\) \(\mathcal {C}_{9}\) \(\mathcal {C}_{6}\) \(\mathcal {C}_{6}\) \(\mathcal {C}_{9}\) \(\mathcal {C}_{9}\) \(\mathcal {C}_{5}\)
\(\mathcal {G}_{2}\) \(\mathcal {C}_{1}\) \(\mathcal {C}_{2}\) \(\mathcal {C}_{2}\) \(\mathcal {C}_{4}\) \(\mathcal {C}_{3}\) \(\mathcal {C}_{4} \) \(\mathcal {C}_{1}\) \(\mathcal {C}_{3}\)
  1. Remark: Because the example considered in Appendix 1 focuses on only a part of the complete k-ambiguity tree in which v7 is irrelevant, the clique memberships of v7 are not given above