Elias Dahlhaus

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 mincut, max-flow problem, and can be solved in polynomial time. We show that the problem(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)
Ž . We present efficient parallel algorithms for two hierarchical clustering heuristics. 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)
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 since then (see []3073, Ha78] for an overview). Context-sensitive grammars are defined as rewriting systems, where the length of the right hand side of every production is at(More)