Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, May 18, 2004, 12:15 pm
Duration: This information is not available in the database
Location: This information is not available in the database
Speaker: Johann A. Makowsky (Technion, Haifa and ETH Zürich)
We introduce formulas of bounded tree width and clique width and discuss the usefulness of these concepts in practical applications.
We show an algorithm which runs in time (4k)n arithmetic operations for formulas of tree width k and length n. Previous algorithms had a constant which was at least double exponential in k.
Similar results hold for formulas of bounded clique width.
(Joint work with E. Fischer and E. Ravve)
Automatic MiSe System Software Version 1.4803M | admin login