No abstract

Thts paper deals wRh the problem of enumerating all the cutsets or all the s-t cutsets separatmg two spectfied verttces s and t m an undirected graph A vanety of approaches have been proposed for this problem, among which one based on the partmon era set of veruces rote two sets is the most effi¢ienL It is first shown that an algorithm of this type has time complexity O((n + m)(n -log2#)#), and two new algorithms with ume complexity O((n + m)O + I)) are then proposed One of these new algorithms has space complexity O(nZ), and the other has space complexity O(n + m), where n and m are the numbers of veraces and edges, respectively, and ta ts the number ofs-t cutsets m a given graph The results of some computatmnal experiments are also described. An mvest~gaUon ~s made of the extent to whtch the new algorithms are better, and how good the performance of the old algorithm is, especmlly when a given graph is "dense," t e, 2m/(n(n -1)) _> 0.4.

No abstract

No abstract

The single-row routing approach for layout has attracted a great deal of interest and is in a position to become one of the fundamental routing methods for high density multilayer printed wiring boards (PWB's).A specific development has recently been accomplished on this approach [12], namely: Necessary and sufficient conditions for optimum routing have been obtained. Nonetheless, there still remains a funda mental problem to be overcome, that is, to develop an algorithm to find the optimum solution.The present paper derives an alternate set of necessary and sufficient conditions for the same problem. These are easy to check and are tailored for algorithm development. An efficient algorithm in the special cases of upper and lower street congestions up to two has been proposed. These special cases are particularly of interest in the design of practical PWB's. S. Tsukiyama and I. Shirakawa are with the