LIPIcs.FSTTCS.2016.5.pdf
- Filesize: 198 kB
- 1 pages
Document
Graph Decompositions and Algorithms (Invited Talk)
Author
-
Part of:
Volume:
36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2016-12-10
Cite AsGet BibTex
Fedor V. Fomin. Graph Decompositions and Algorithms (Invited Talk). In 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 65, p. 5:1, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/LIPIcs.FSTTCS.2016.5
https://doi.org/10.4230/LIPIcs.FSTTCS.2016.5
Abstract
We overview the recent progress in solving intractable optimization problems on planar graphs as well as other classes of sparse graphs. In particular, we discuss how tools from Graph Minors theory can be used to obtain:
* subexponential parameterized algorithms
* approximation algorithms, and
* preprocessing and kernelization algorithms
on these classes of graphs.
Keywords
- Algorithms
- logic
- graph minor
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads