With this method, the reliability to direct the constraint graph is increased, the computation complexity is reduced, and the cyclic constraint graph can be solved expediently.
应用此方法，可提高约束图有向化的可靠性、降低计算复杂度，且能方便地求解带有循环约束的约束图。
2
At last, applying the distance graph of the reduced decision table, we propose a way to get the core of each decision rule.
最后，建立了一个利用约简决策表的距离图求决策规则的核值及最小决策算法的算法框架。
3
For an arbitrary polyhedral graph, four classes of polyhedral links can be obtained by applying the operation of 'x-tangle covering 'to the related reduced sets.