1.
The Lower Bound on the Size of Edge-Coloring Critical Graph & the Fractional Edge Coloring of Some Graphs;
临界图边数的下界与某些图类的分数边染色
2.
The New Lower Bound of the Number of Vertices of Degree 5 and Trivially Noncontractible Edges in Contraction Critical 5 Connected Graphs;
收缩临界5连通图的5度顶点数和平凡不可收缩边数的新的下界
3.
A Note on the p Critical 2-Edge-Connected Graph;
关于p阶临界2边连通图的一个注记
4.
Image-Based Edge Automatic Extraction of Point Data
基于图像法的点云数据边界自动提取
5.
The New Lower Bound of the Number of Vertices of Degree 6 in Contraction Critical 6 Connected Graphs;
收缩临界6连通图中6度顶点数新的下界
6.
A noncomplete6 connected graph is called contraction-critical if it has no any6- contractible edge.
一个不包含6可收缩边的非完全图被称为收缩临界6连通图.
7.
The Nonlinear Boundary Value Problem of a Class of p-Laplace Equation Involving Critical Exponent;
一类含临界指数p-Laplace方程的非线性边值问题
8.
Elliptic Boundary Value Problems Involving Critical Sobolev Exponents and Singular Terms;
带奇异项和Sobolev临界指数项的椭圆边值问题
9.
Study on a method of finding the artery edge of Digital Subtraction Angiography
一种提取数字减影图像血管边界方法的研究
10.
Images Matching Approach Based on Moving Boundaries and Energy Function Optimization
基于运动边界和能量函数最优的图像匹配算法
11.
Upper Bound Of The Maximum Possible Numbers OF Edges In A Simple Graph Containing no 3-Regular Subgraph
不含3正则子图之简单图的最大可能边数的一个上界
12.
Two Upper Bound of the Adjacent Strong Edge Coloring and the Adjacent Vertex Distinguishing Total Coloring of General Mycielski-Graphs
广义Mycielski图的邻强边色数和邻点可区别全色数的两个上界
13.
marginal containerizable cargo
边缘装箱货临界货物
14.
vertical etched edge profile
垂直腐蚀边界剖面图
15.
Image segmentation algorithm based on mathematical morphology and active edgeless contour model without edges
结合数学形态学和无边界主动轮廓模型的图像分割方法
16.
One Upper Bound on the D(2)-Vertex-Distinguishing Chromatic Numbers of Graphs
图的距离不大于2的点可区别边色数的一个上界
17.
Boundary-Pattern Mathematical Programming Nonlinear Multipole Boundary Element Method;
边界型数学规划非线性多极边界元法
18.
On Hamiltonian Properties of 3-γ-critical Graphs;
关于3-γ-临界图的Hamilton性