本文给出既含无向边又含有向边混合单触点开关网络的拓扑分析与综合的直接方法。
This paper gives the direct approaches for topological analysis and synthesis of hybrid single contact switching networks which contain both undirected and directed edges.
黑白旅行商问题(BWTSP)是近年来出现的新NP -难解问题，根据图中边是否对称可以分为无向BWTSP和有向BWTSP两种。
The black and white salesman problem (BWTSP) is a new NP-hard problem, which can be divided into the undirected BWTSP and the directed BWTSP according to the symmetry of edges in graph.
给定一个无向连通图g，圈包装问题就是求g的边不相交圈的最大数目。
In the cycle packing problem, given an undirected connected graph g, it is required to find the maximum number of pairwise edge disjoint cycles in g.
应用推荐