DagRep.12.11.109.pdf
- Filesize: 1.63 MB
- 15 pages
Document
Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 12, Issue 11
Volume: Dagstuhl Reports, Volume 12
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2023-05-04
Cite AsGet BibTex
Maria Chudnovsky, Neeldhara Misra, Daniel Paulusma, Oliver Schaudt, and Akanksha Agrawal. Vertex Partitioning in Graphs: From Structure to Algorithms (Dagstuhl Seminar 22481). In Dagstuhl Reports, Volume 12, Issue 11, pp. 109-123, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
https://doi.org/10.4230/DagRep.12.11.109
https://doi.org/10.4230/DagRep.12.11.109
Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 22481 "Vertex Partitioning in Graphs: From Structure to Algorithms", which was held from 27 November to 2 December 2023. The report contains abstracts for presentations about recent structural and algorithmic developments for a variety of vertex partitioning problems. It also contains a collection of open problems which were posed during the seminar.
Subject Classification
ACM Subject Classification
- Mathematics of computing → Graph algorithms
- Theory of computation → Problems, reductions and completeness
Keywords
- computational complexity
- hereditary graph classes
- parameterized algorithms
- polynomial-time algorithms
- vertex partitioning
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads