[up] Up a level
Group by: Item Type | Date | No Grouping
Jump to: 2002 | 1999 | 1997
Number of items: 4.

2002

Dahlhaus, Elias (2002). Minimal Elimination Ordering for Graphs of Bounded Degree. Discrete Applied Mathematics, 116 (1-2). pp. 127-143. Elsevier Science.

1999

Dahlhaus, Elias (1999). An Improved Linear Time Algorithm for Minimal Elimination Ordering in Planar Graphs that is Parallelizable. Working Paper.

Dahlhaus, Elias (1999). Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs. ['eprint_fieldopt_monograph_type_preprint' not defined].

1997

Dahlhaus, Elias (1997). Minimal Elimination Ordering Inside a Given Chordal Graph. Springer. ['eprint_fieldopt_monograph_type_preprint' not defined].

This list was generated on Sun Jan 4 01:21:56 2026 CET.