Generation of Trees without Duplications
- 1 June 1965
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuit Theory
- Vol. 12 (2) , 181-185
- https://doi.org/10.1109/tct.1965.1082432
Abstract
Recent emphasis on the use of electronic digital computers has focused attention on a number of practical problems which were hitherto treated on an "existence" basis. One problem which arises in computer analysis of electrical networks is the listing of all trees in the network. Any practically useful scheme must find all the trees of the network without generating duplicates (for practical networks the number of trees exceeds the fast memory of any computer and, hence, slows down search for duplicates). Also, the trees must be generated by replacement of one branch at a time in order to keep track of signs (for active network analysis). A practical procedure satisfying these conditions is presented in this paper.Keywords
This publication has 6 references indexed in Scilit:
- Generation and Realization of Trees and k-TreesIEEE Transactions on Circuit Theory, 1964
- On trees of a graph and their generationJournal of the Franklin Institute, 1961
- A Computational Method for Network TopologyIRE Transactions on Circuit Theory, 1960
- On Coefficients of Polynomials in Network FunctionsIRE Transactions on Circuit Theory, 1960
- Correction to "Reducing computing time in the analysis of networks by digital computer"IRE Transactions on Circuit Theory, 1959
- General Topological Formulas for Linear Network FunctionsIRE Transactions on Circuit Theory, 1958