Given a tree with nonnegative edge cost and nonnegative vertex weight, and a number k ≥ 0, we consider the following four cut problems: cutting vertices of weight at most or at least k from the tree by deleting some edges such that the remaining part of the graph is still a tree and the total cost of the edges being deleted is minimized or maximized. The MinMstCut problem (cut vertices of weigh...

modeling and simulation of communication circuits at high frequency are important challenges ahead in the design and construction of these circuits. knowing the fact that the lumped element model is not valid at high frequency, distributed analysis is presented based on active and passive transmission lines theory. in this paper, a lossy transmission line model of traveling wave switch (twsw) i...