Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Width Functions Hypertree Decompositions
 

Summary: Width Functions
for
Hypertree Decompositions
Isolde Adler
Dissertation zur Erlangung des Doktorgrades
der Fakult¨at f¨ur Mathematik und Physik
der Albert-Ludwigs-Universit¨at Freiburg im Breisgau
January 2006
Dekan: Prof. Dr. Josef Honerkamp
Gutachter: Prof. Dr. J¨org Flum
Prof. Dr. Martin Grohe
Datum der m¨undl. Pr¨ufung: 18.04.2006
Contents
Prologue 1
1 Tree-width 3
1.1 Tree decompositions of infinite graphs . . . . . . . . . . . . . . . . . 3
1.2 Simplicial decompositions . . . . . . . . . . . . . . . . . . . . . . . . 6
1.3 Tree-width and k-trees . . . . . . . . . . . . . . . . . . . . . . . . . . 9
1.3.1 Smooth tree decompositions . . . . . . . . . . . . . . . . . . . 9
1.3.2 k-trees . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10

  

Source: Adler, Isolde - Institut für Informatik, Johann Wolfgang Goethe-Universität Frankfurt am Main

 

Collections: Computer Technologies and Information Sciences