Title :
Efficient algorithm for common spanning tree problem
Author_Institution :
University of Cape Town, Computer Science Department, Rondebosch, South Africa
Abstract :
Enumerating the spanning trees common to a pair of graphs is a problem which arises in symbolic circuit analysis. The algorithm presented here is between 350% and 26000% faster than the best algorithm previously published, and hence the computer analysis of circuits of a reasonable size is now feasible.
Keywords :
algorithm theory; circuit analysis computing; trees (mathematics); algorithm; circuit analysis computing; common spanning tree problem; symbolic circuit analysis; tree enumeration method;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19830240
