产生符号网络函数的主子超图法
PRIMARY SUBHYPERGRAPH METHOD FOR GENERATING SYMBOLIC NETWORK FUNCTIONS
-
摘要: 文中引入完全超树和主子超图的概念,并提出产生线性有源网络之符号网络函数的一个新方法主子超图法。它是主子图法[1]的改进。它的表达式很紧凑,计算时间复杂度为O(venl)。通常叶总数nl远小于主子图数np,所以它的计算效率高于主子图法。Abstract: The concepts of complete hypertree and primary subhypergraph are introduced, and a new method--primary subhypergaph mathod is presented for generating symbolic network functions. It is an improvement of primary subgraph method. Its resulting expressions are very compact, and its computinp time complexity is O(venl). In general, the total number of leaves nl is far less than the numberof primary subgraphs np, hence its computation -efficiency is higher than that of primary subgraph method.
-
黄汝激,电子科学学刊,8(1986), 335-342.[2]黄汝激,电子科学学刊,9(1987), 244-255.[3]W. K. Chen, Applied Graph Theory, Amsterdam, North-Holland, 1976.[4]黄汝激,电子科学学刊,7(1985), 254-266.[5]黄汝激,电子学报,1987年,第5期,第8-13页.[6]W. Mayeda, Graph Theory, John Wiley and Sons, Inc.,1972, ch. 8.[7]黄汝激,北京钢铁学院学报,1982年,第2期,第83-89页.[8]E. Horowize, S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, Potomac,Maryland, 1978, chs. 1,7,8. -
计量
- 文章访问数: 1896
- HTML全文浏览量: 139
- PDF下载量: 344
- 被引次数: 0
下载:
