 | Up a level |
Journal Article
Dahlhaus, Elias
(2002).
Minimal Elimination Ordering for Graphs of Bounded Degree.
Discrete Applied Mathematics, 116 (1-2).
pp. 127-143.
Elsevier Science.
Preprints, Working Papers or Reports
Dahlhaus, Elias
(1999).
An Improved Linear Time Algorithm for Minimal Elimination Ordering in Planar Graphs that is Parallelizable.
Working Paper.
Dahlhaus, Elias
(1997).
Minimal Elimination Ordering Inside a Given Chordal Graph.
Springer.
["eprint_fieldopt_monograph_type_preprint" not defined].
Dahlhaus, Elias
(1999).
Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs.
["eprint_fieldopt_monograph_type_preprint" not defined].