| 1. | New results for the crossing number of circular graphs
循环图交叉数的新结果 |
| 2. | Consequently , there is urgent need of good algorithm for calculating the crossing number of graph
因此，迫切希望有较好的计算机算法用以计算图的交叉数。 |
| 3. | The crossing number of graph , which is an np - complete problem , has an important theory meaning
图的交叉数问题属于np -困难问题，对它的研究有重要的理论意义。 |
| 4. | In addition , erdos and guythe ' s conjecture about graphs with maximal crossing number is proved incorrect
还证明了erdos和guy关于可能有最大的交叉数的图的猜想不成立。 |
| 5. | Using the algorithm ccn ( calculate crossing number ) invented by us , we investigate the crossing numbers of all graphs for n < 9
利用我们研制的计算图的交叉数的算法ccn ( calculatecrossingnumber ) ，本文对n 9的所有图的交叉数进行了研究。 |
| 6. | Minutiae can be extracted with exactitude by using 8 - neighborhood cross - calculation algorithm , a kind of algorithms featured especially in its ability of anti - jamming
所使用的求取8 -领域交叉数算法能够准确地提取指纹图像的细节特征，并表现出较强的抗干扰性。 |
| 7. | In minutiae extraction , a 8 - neighborhood ’ s crossing number algorithm is adopted . then we deleted false minutiae directly in post processing of minutiae extraction
特征提取算法采用了八邻域交叉数法,由于该算法提取出的特征点中含有伪特征,需要进行伪特征消除处理。 |
| 8. | Using the algorithm ccn ( calculate crossing number ) , this article researches on the relation between the crossing number and girth of the 3 - regular graphs
利用计算交叉数的算法ccn ( calculatecrossingnumber ) ，本文对三正则图的交叉数与围长的关系进行了深入的研究。 |
| 9. | Since the crossing numbers of graph equal the sum of the crossing numbers of all its 2 - connected blocks , we work on the crossing numbers of graphs for n < 9 with unique 2 - connected block .
由于图的交叉数等于其所有二连通分支的交叉数的和，本文计算了n 9的所有单二连通分支图的交叉数。 |
| 10. | For a long time , mathematic method is used in the research of the crossing number of graph . however , if the graph is very big , the possible number of drawing will increase rapidly
长期以来，图的交叉数的研究主要采用纯数学方法，但随着所研究图的增大，可能的画法急剧增长，研究也越来越困难。 |
