Dagstuhl-Seminar 99231
Graph Decompositions and Algorithmic Applications
( 06. Jun – 11. Jun, 1999 )
Permalink
Bitte benutzen Sie folgende Kurz-Url zum Verlinken dieser Seite:
https://www.dagstuhl.de/99231
Organisatoren
- A. Brandstädt (Rostock)
- J. P. Spinrad (Nashville)
- S. Olariu (Norfolk)
Kontakt
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.
- A. Brandstädt (Rostock)
- J. P. Spinrad (Nashville)
- S. Olariu (Norfolk)
Verwandte Seminare
- Dagstuhl-Seminar 01251: Graph Decompositions and Algorithmic Applications (2001-06-17 - 2001-06-22) (Details)
- Dagstuhl-Seminar 04221: Robust and Approximative Algorithms on Particular Graph Classes (2004-05-23 - 2004-05-28) (Details)
- Dagstuhl-Seminar 07211: Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes (2007-05-20 - 2007-05-25) (Details)
- Dagstuhl-Seminar 11182: Exploiting graph structure to cope with hard problems (2011-05-01 - 2011-05-06) (Details)
- Dagstuhl-Seminar 14071: Graph Modification Problems (2014-02-09 - 2014-02-14) (Details)
