通过对于对称欧拉图和对称欧拉路径的研究，得出了多项理论结果。
Several theoretical results are obtained by studying symmetric Eulerian graph and symmetric Eulerian trail.
这个图既没有欧拉回路，也没有欧拉路径。因为有超过两个顶点的度数为奇数。
Neither Eular circuit nor Eular path exists in this graph, since there are more than two vertices with odd degree.
所提出的算法用基于路径的组播路由模型，而不是在网络中找出哈密尔顿路径或欧拉路径。
The proposed algorithms use path-based multicast routing models, other than by finding Hamiltonian or Eulerian path in the network.
本文在基本欧拉路径方法的基础上，提出一种拓展的欧拉路径方法，使之能够应用于所有互补CMOS电路和动态电路的版图布局。
In this dissertation, we present an expanded Euler Path method, which extend the origin Euler Path method to the floor plan of all kind of CMOS circuit as well as the dynamic circuit.
本文在基本欧拉路径方法的基础上，提出一种拓展的欧拉路径方法，使之能够应用于所有互补CMOS电路和动态电路的版图布局。
In this dissertation, we present an expanded Euler Path method, which extend the origin Euler Path method to the floor plan of all kind of CMOS circuit as well as the dynamic circuit.
应用推荐