|
|
|
| PRIMARY SUBHYPERGRAPH METHOD FOR GENERATING SYMBOLIC NETWORK FUNCTIONS |
| Huang Ruji |
| Beijing College of Iron and Steel Technology Beijing |
|
|
|
|
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(ve∑nl). 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.
|
|
Received: 07 July 1987
|
|
|
|
|
|
|
1989, Vol. 11 
