Learn More
In the Multiterminal Cut problem we are given an edge-weighted graph and a subset of the vertices called terminals, and asked for a minimum weight set of edges that separates each terminal from all the others. When the number k of terminals is two, this is simply the min-cut, max-flow problem, and can be solved in polynomial time. We show that the problem(More)
Ž. We present efficient parallel algorithms for two hierarchical clustering heuris-tics. We point out that these heuristics can also be applied to solving some algorithmic problems in graphs, including split decomposition. We show that efficient parallel split decomposition induces an efficient parallel parity graph recognition algorithm. This is a(More)
t. Abstract: The membership problem for fixed context-sensitive languages is polynomial if the right hand side of every production is strictly longer than the left hand side. 2. Introduction. Context-sensitive grammars (csgs) are one of the classical grammar families of formal language theory. They were introduced in [Ch59] and have been studied extensively(More)
To study the molecular regulation of nectary development, we cloned NEC1, a gene predominantly expressed in the nectaries of Petunia hybrida, by using the differential display RT-PCR technique. The secondary structure of the putative NEC1 protein is reminiscent of a transmembrane protein, indicating that the protein is incorporated into the cell membrane or(More)
In the Multiway Cut problem we are given an edge-weighted graph and a subset of the vertices called terminals, and asked for a minimum weight set of edges that separates each terminal from all the others. When the number <italic>k</italic> of terminals is two, this is simply the min-cut, max-flow problem, and can be solved in polynomial time. We show that(More)
The problem considered in this paper arose in connection with the rearrangement of railroad cars in China. In terms of sequences the problem reads as follows: contains all the elements of S p(1) , then all elements of S p(2) , : : :, etc., and nally all elements of S p(t). The aim of this paper is to show that the decision problem: \Given numbers n; k and a(More)