DagRep.1.5.29.pdf
- Filesize: 0.9 MB
- 18 pages
Document
Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 1, Issue 5
Volume: Dagstuhl Reports, Volume 1
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2011-08-31
Cite AsGet BibTex
Andreas Brandstädt, Martin Charles Golumbic, Pinar Heggernes, and Ross McConnell. Exploiting graph structure to cope with hard problems (Dagstuhl Seminar 11182). In Dagstuhl Reports, Volume 1, Issue 5, pp. 29-46, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)
https://doi.org/10.4230/DagRep.1.5.29
https://doi.org/10.4230/DagRep.1.5.29
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 11182 ``Exploiting graph structure to cope with hard problems'' which has been held in Schloss Dagstuhl -- Leibniz Center for Informatics from May 1st, 2011 to May 6th, 2011.
During the seminar experts with a common focus on graph algorithms presented various new results in how to attack NP-hard graph problems by using the structure of the input graph.
Moreover, in the afternoon of each seminar's day new problems have been posed and discussed.
Keywords
- Graph Classes
- Graph Algorithms
- NP-completeness
- Width Parameters
- Approximation Algorithms
- Parameterized Complexity
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads