#### Filter Results:

- Full text PDF available (40)

#### Publication Year

1982

2014

- This year (0)
- Last 5 years (3)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Elias Dahlhaus, David S. Johnson, Christos H. Papadimitriou, Paul D. Seymour, Mihalis Yannakakis
- SIAM J. Comput.
- 1994

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)

- Elias Dahlhaus
- J. Algorithms
- 2000

Ž . 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)

- Elias Dahlhaus, Manfred K. Warmuth
- J. Comput. Syst. Sci.
- 1986

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)

- Elias Dahlhaus
- LATIN
- 1998

- Elias Dahlhaus
- Discrete Applied Mathematics
- 1995

- Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
- SODA
- 1997

We give a simple recursive algorithm for modular decomposition of undirected graphs that runs in O(n+mα(m;n)) time. Previous algorithms with this bound are of theoretical use only. By adding some data structure tricks, we get a much simpler proof of an O(n+m) bound than was previously available. Key components of the algorithm are variations of a procedure… (More)

- Elias Dahlhaus, Jens Gustedt, Ross M. McConnell
- J. Algorithms
- 2001

- Elias Dahlhaus
- ORDAL
- 1994

- Elias Dahlhaus
- Computation Theory and Logic
- 1987