Minimum length linear transistor arrays in MOS
C.T. McMullen, Ria Otten · 2003
The following abstract problem is solved: given a two-terminal series-parallel (sp) graph, find an sp-equivalent graph in which the number of vertices with odd degree is minimum, where an sp-equivalence class consists of the graphs with the same series and parallel connections except for their order. The motivation for this problem is to find a minimum-length one-dimensional transistor array for MOS-discharge networks.>