In this paper, we study the crossing numbers of the cartesian product graph.

本文研究一类笛卡尔积图的交叉数.

互联网

Multiple classes may appear, resulting in a cartesian product or cross join.

出现多个类,会导致笛卡尔积或者称“交差”连接.

互联网

This paper discusses the upper chromatic number of the Cartesian product of co - hypergraphs.

讨论反超图的笛卡儿积的着色理论,求出了满足一定条件的反超图的笛卡儿积的上色数.

互联网

Nested queries in the project clause might get translated into Cartesian product queries on the server.

投影子句中的嵌套查询可在服务器上转换为笛卡尔积查询.

互联网