论文信息 - Generation of color-constrained spanning trees with application in symbolic circuit analysis

Generation of color-constrained spanning trees with application in symbolic circuit analysis

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.<<ETX>>

Qicheng Yu | Carl Sechen

[1] Greg N. Frederickson,et al. Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications , 1985, SIAM J. Comput..

[2] P. Lin. Symbolic network analysis , 1991 .

[3] Robert E. Tarjan,et al. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs , 1986, Comb..

[4] Robert E. Tarjan,et al. Efficient Algorithms for a Family of Matroid Intersection Problems , 1984, J. Algorithms.

[5] Greg N. Frederickson,et al. On-line Updating of Solutions to a Class of Matroid Intersection Problems , 1987, Inf. Comput..

[6] Harold N. Gabow,et al. Two Algorithms for Generating Weighted Spanning Trees in Order , 1977, SIAM J. Comput..

[7] Robert E. Tarjan,et al. Applications of Path Compression on Balanced Trees , 1979, JACM.

[8] E. Lawler. A PROCEDURE FOR COMPUTING THE K BEST SOLUTIONS TO DISCRETE OPTIMIZATION PROBLEMS AND ITS APPLICATION TO THE SHORTEST PATH PROBLEM , 1972 .

[9] Toshihide Ibaraki,et al. An Algorithm for Finding K Minimum Spanning Trees , 1981, SIAM J. Comput..

[10] David Eppstein,et al. Finding the k Smallest Spanning Trees , 1990, BIT.

[11] Greg N. Frederickson,et al. Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.