Symbolic Analysis Based on Graph Transformations

The paper deals with implementation details of a method for approximate symbolic analysis of linear circuits based on nontrivial transformations of voltage and current graphs. The method is based on eliminating the low-voltage branches from "high-voltage" loops and the low-current branches from "high-current" cuts. This goes beyond the simple edge deletion or contraction used in previous methods. The paper describes a graph transformation for decreasing the number of spanning trees and its computer implementation.