June 6 – 11 , 1999, Dagstuhl Seminar 99231

Graph Decompositions and Algorithmic Applications


A. Brandstädt (Rostock), S. Olariu (Norfolk), J. P. Spinrad (Nashville)

For support, please contact

Dagstuhl Service Team


Dagstuhl-Seminar-Report 241


The seminar should bring together experts from different fields of graph decomposition. It is motivated by the many successful applications of graph (and other) decomposition methods to the design of efficient graph algorithms, and it will have the following aims:

  • extending known graph decompositions such as the modular 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
  • exchange of information on recent research and stimulation of further research in the direction of graph decompositions and its algorithmic applications.

Dagstuhl Seminar Series


In the series Dagstuhl Reports each Dagstuhl Seminar and Dagstuhl Perspectives Workshop is documented. The seminar organizers, in cooperation with the collector, prepare a report that includes contributions from the participants' talks together with a summary of the seminar.


Download overview leaflet (PDF).


Furthermore, a comprehensive peer-reviewed collection of research papers can be published in the series Dagstuhl Follow-Ups.

Dagstuhl's Impact

Please inform us when a publication was published as a result from your seminar. These publications are listed in the category Dagstuhl's Impact and are presented on a special shelf on the ground floor of the library.