• In Chapter three, we discuss the crossing number of the join.

    在第三章中探讨了与联图有关的交叉数。

    youdao

  • The crossing number of graph, which is an NP-complete problem, has an important theory meaning.

    图的交叉数问题属于NP -困难问题,对它的研究有重要的理论意义。

    youdao

  • This paper considers the handle affecting the crossing number of circular graphs and gives upper bounds for its crossing numbers.

    考虑环柄对循环图交叉数的影响,并且给出了循环图交叉数的上界。

    youdao

  • 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领域有广阔的应用。

    youdao

  • 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领域有广阔的应用。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定