Title :
Algorithm for finding the common spanning trees of two graphs
Author_Institution :
University of Reading, Department of Engineering, Reading, UK
Abstract :
A new algorithm is described which finds the common spanning trees of two graphs efficiently and without duplication. The algorithm can be incorporated in a symbolic circuit analysis program where its speed and storage requirements are such that circuits of considerable complexity can be analysed on small computers.
Keywords :
active networks; circuit analysis computing; network topology; trees (mathematics); active networks; circuit analysis computing; common spanning trees; network topology; symbolic circuit analysis program;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19810328
