Graph Decompositions and Algorithmic Applications

The main goal of this seminar is to bring together experts working in various areas of graph decomposition. Given the fast advances in graph decompositions that we have witnessed in the past few years, we believe that it is very important to offer researchers in graph decomposition a forum for the exchange of ideas in the relaxed workshop-like atmosphere that Dagstuhl can offer.

We anticipate strong interaction and a very healthy exchange of ideas that is likely to result in successful applications of graph (and other) decomposition methods to the design of efficient algorithms, and it will have the following aims:

• extending known graph decompositions such as the modular, the primeval and the homogeneous decomposition
• new structural insights by studying graph decomposition
• extending results on the tree structure of graphs and using such results for the design of efficient algorithms
• new results on the P4 structure of graphs and decompositions related to this concept such as the investigation of p-connected components
• exchange of information on recent research and stimulation of further research in the direction of graph decompositions and its algorithmic applications.