Searching for authors named "Elias Dahlhaus" – sorted by Relevance.
25 documents found, showing 1 through 10.
Next 10 →
-
An Improved Linear Time Algorithm for Minimal Elimination Ordering in Planar Graphs that is Parallelizable
- … that is Parallelizable ? Elias Dahlhaus Dept. of Computer Science University of Bonn Bonn, Germany ?? and Department…
- Cited by 1 (0 self) – Add To MetaCart
-
Minimal Elimination Ordering for Graphs of Bounded Degree
- … Ordering for Graphs of Bounded Degree by Elias Dahlhaus 1999 Partially supported by ESPRIT Long Term…
- Cited by 2 (1 self) – Add To MetaCart
-
Efficient Parallel Algorithms on Chordal Graphs with a Sparse Tree Representation
- …Efficient Parallel Algorithms on Chordal Graphs with a Sparse Tree Representation Elias Dahlhaus…
- Cited by 2 (2 self) – Add To MetaCart
-
A Simple Efficient Parallel Algorithms to Recognize Chordal Graphs as Interval Graphs
- … Dahlhaus Basser Dept. of Computer Science University of Sydney NSW 2006, Australia Abstract We present…
- Cited by 1 (1 self) – Add To MetaCart
-
The Parallel Complexity of Elimination Ordering Procedures
- …The Parallel Complexity of Elimination Ordering Procedures Elias Dahlhaus Basser Dept. of Computer…
- Cited by 1 (0 self) – Add To MetaCart
-
Generalized Strongly Chordal Graphs
- …Generalized Strongly Chordal Graphs Elias Dahlhaus Basser Dept. of Computer Science University…
- Cited by 2 (0 self) – Add To MetaCart
-
Minimal Elimination of Planar Graphs
- …We prove that the problem to get an inclusion minimal elimination ordering can be solved in linear time for planar graphs. The basic structure of the linear time algorithm is as follows. We select a vertex r as maximum and get a first approximation of a minimal elimination ordering considering a ver…
- Cited by 2 (1 self) – Add To MetaCart
-
Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs
- …-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs by Elias Dahlhaus 1999 A preliminary…
- Cited by 3 (1 self) – Add To MetaCart
-
Linear Time Algorithm to Recognize Clustered Planar Graphs and its Parallelization
- … to Recognize Clustered Planar Graphs and its Parallelization by Elias Dahlhaus 1998 An extended abstract…
- Cited by 11 (0 self) – Add To MetaCart
-
Minimal Elimination Ordering Inside a Given Chordal Graph
- …Minimal Elimination Ordering Inside a Given Chordal Graph Elias Dahlhaus Dept. of Computer…
- Cited by 24 (2 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
