Campus Event Calendar
Event Entry
New for: D3
What and Who
How to Minimize Fill-ins on Arbitrary Graphs (II)
Elias Dahlhaus
Dept. of Computer Science, University of Bonn
AG1 Advanced Mini-Course
AG 1, AG 2, AG 3, AG 4
AG Audience
English
Note: We use this to send email in the morning.
Date, Time and Location
Thursday, 22 July 99
13:30
90 Minutes
46
24
Saarbrücken
Abstract
This is a continuation of the minic-ourse starting on July 20.
The second session covers the following topics:
1) Conversions of orderings into Minimal Elimination Orderings
(More sophisticated strategy)
-Cuts of the Original Graph Related to Cuts
of the Fill-in Graph
-Splitting Cuts of Fill-in Graph into Cuts
of the Original Graph (''Quasi-Minimal
Elimination Ordering'')
-Refinement of the Quasi-Minimal Elimination
Ordering.
2) Speeding up Minimal Elimination Ordering by
the Use of a Spanning Tree and its Postorder,
Applications in Planar and Bounded Degree Graphs
and the Use in a Parallel Minimal Elimination
Ordering Algorithm.
Contact
Petra Mutzel / Elias Dahlhaus
528
--email hidden
passcode not visible
logged in users only
Tags, Category, Keywords and additional notes
fill-in, sparse matrices, chordal graphs, efficient algorithms