IEEE/ICACT20210168 Slide.11        [Big Slide]       Oral Presentation
After the omitting step, each node in the network has an even degree. We generate a backbone cycle by using the Eulerian cycle algorithm to cover all remaining undirected links. Here, there are two options: BBT T1 has a full Eulerian cycle as the backbone path, see the bold lines in Figure 7. BBT T2 has two backbone paths that are two reversed halves of the Eulerian cycle.

[Go to Next Slide]
Select Voice: