DagRep.4.2.38.pdf
- Filesize: 0.9 MB
- 22 pages
Document
Graph Modification Problems (Dagstuhl Seminar 14071)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 4, Issue 2
Volume: Dagstuhl Reports, Volume 4
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2014-06-03
Cite AsGet BibTex
Hans L. Bodlaender, Pinar Heggernes, and Daniel Lokshtanov. Graph Modification Problems (Dagstuhl Seminar 14071). In Dagstuhl Reports, Volume 4, Issue 2, pp. 38-59, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)
https://doi.org/10.4230/DagRep.4.2.38
https://doi.org/10.4230/DagRep.4.2.38
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 14071 "Graph Modification Problems". The seminar was held from February 9 to February 14, 2014. This report contains abstracts for presentations about the recent
developments on algorithms and structural results for graph modification problems, as well as related areas. Furthermore, the report contains a summary of open problems in this area of research.
Keywords
- graphs
- algorithms
- graph modification
- fixed parameter tractable
- graph classes
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads