Title :
Generation of color-constrained spanning trees with application in symbolic circuit analysis
Author :
Yu, Qicheng ; Sechen, Carl
Author_Institution :
Dept. of Electr. Eng., Washington Univ., Seattle, WA, USA
Abstract :
Proves a property of the second lowest weight spanning tree with color constraint. It enables one to enumerate color-constrained spanning trees in the increasing order of their weights by generalizing existing algorithms for the uncolored problem. A version of the algorithm is implemented in a program for the approximate symbolic analysis of large analog circuits
Keywords :
analogue circuits; circuit analysis computing; linear network analysis; network topology; trees (mathematics); color-constrained spanning trees; large analog circuits; second lowest weight; symbolic circuit analysis; uncolored problem; Algorithm design and analysis; Analog circuits; Capacitance; Circuit analysis; Color; Frequency; IEL; Sorting; Transfer functions; Tree graphs;
Conference_Titel :
VLSI, 1994. Design Automation of High Performance VLSI Systems. GLSV '94, Proceedings., Fourth Great Lakes Symposium on
Conference_Location :
Notre Dame, IN
Print_ISBN :
0-8186-5610-7
DOI :
10.1109/GLSV.1994.289959
