 |
Since an Eulerian cycle exists if and only if the graph consists of only even-degree vertices, first we need to remove all links incident to odd-degree vertices (nodes) temporarily, called ``omitted links''.
The general idea of processing odd degree nodes is to omit the links between their couples.
In this way, the degrees of these nodes become zero or even. Note that the number of odd degree nodes is always even. Omitting links should try to keep the network connected and Minimize the number of omitted links. |
IEEE/ICACT20210168 Slide.10
[Big Slide]