For general graph, it is a NP-hard question to get the bondage number or reinforcement number.
对一般的图，求其绑定数和增强数是NP -困难问题，在本文中我们求出了两类图的绑定数和增强数。
In this paper, a general method for meta-graph recognition is proposed based on curve fitting and separation of line and smooth curve.
本文针对图纸矢量化中的图元识别技术，提出了系统的基于线弧分离和拟合识别方法。
Proposed a duplication based task scheduling algorithm with communication limits for general task graph, TDMSCL.
给出针对普通任务图带通信限制的基于复制调度算法TDMSCL。
应用推荐