產(chǎn)生符號網(wǎng)絡(luò)函數(shù)的主子超圖法
PRIMARY SUBHYPERGRAPH METHOD FOR GENERATING SYMBOLIC NETWORK FUNCTIONS
-
摘要: 文中引入完全超樹和主子超圖的概念,并提出產(chǎn)生線性有源網(wǎng)絡(luò)之符號網(wǎng)絡(luò)函數(shù)的一個新方法主子超圖法。它是主子圖法[1]的改進(jìn)。它的表達(dá)式很緊湊,計算時間復(fù)雜度為O(venl)。通常葉總數(shù)nl遠(yuǎn)小于主子圖數(shù)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.
-
黃汝激,電子科學(xué)學(xué)刊,8(1986), 335-342.[2]黃汝激,電子科學(xué)學(xué)刊,9(1987), 244-255.[3]W. K. Chen, Applied Graph Theory, Amsterdam, North-Holland, 1976.[4]黃汝激,電子科學(xué)學(xué)刊,7(1985), 254-266.[5]黃汝激,電子學(xué)報,1987年,第5期,第8-13頁.[6]W. Mayeda, Graph Theory, John Wiley and Sons, Inc.,1972, ch. 8.[7]黃汝激,北京鋼鐵學(xué)院學(xué)報,1982年,第2期,第83-89頁.[8]E. Horowize, S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, Potomac,Maryland, 1978, chs. 1,7,8. -
計量
- 文章訪問數(shù): 1944
- HTML全文瀏覽量: 153
- PDF下載量: 347
- 被引次數(shù): 0
下載:
