The crossing number of graph, which is an NP-complete problem, has an important theory meaning.
图的交叉数问题属于NP -困难问题，对它的研究有重要的理论意义。
It has many applications in CAD. It is proved that the problem of determining the crossing number of an arbitrary graph is NP-complete.
图的交叉数问题是在实际应用中提出来的，在CAD领域有广阔的应用。
The crossing number of a graph is the minimum number of pairwise intersections of edges in a drawing of in the plane.
图的交叉数只在好画法中得到，好画法是指满足边自身不交叉，相关联的边不交叉，任意两条交叉的边至多交叉一次的画法。
The crossing number of a graph is the minimum number of pairwise intersections of edges in a drawing of in the plane.
图的交叉数只在好画法中得到，好画法是指满足边自身不交叉，相关联的边不交叉，任意两条交叉的边至多交叉一次的画法。
应用推荐