Graph Decompositions and Algorithms (Invited Talk)

Fomin, Fedor V.

doi:10.4230/LIPIcs.FSTTCS.2016.5

Document

Graph Decompositions and Algorithms (Invited Talk)

Author Fedor V. Fomin

Part of: Volume: 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: 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

PDF

File

PDF

LIPIcs.FSTTCS.2016.5.pdf

Filesize: 198 kB
1 pages

Document Identifiers

DOI: 10.4230/LIPIcs.FSTTCS.2016.5
URN: urn:nbn:de:0030-drops-68903

Subject Classification

Keywords

Algorithms
logic
graph minor

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get 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

Author Details

Fedor V. Fomin

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail