关于最小欧拉定向的算法

AN ALGORITHM FOR MINIMUM EULERIAN ORIENTATION

给出了无向边集是支撑树的混合图为欧拉图的充要条件 .在此基础上 ,结合 Guan和 Pulleyblank算法 ,给出了另外一种求解最小欧拉定向的算法 .

A necessary and sufficient condition for a special mixed qraph (whose undirected edge set is a spanning tree) to be an Eulerian graph is given. Based on the above condition and Guan and Pulleybland′s algorithm, another algorithm for the minimum Eulerian orientation is given.