LIPIcs.IPEC.2015.236.pdf
- Filesize: 491 kB
- 12 pages
Document
Fixed-parameter Tractable Distances to Sparse Graph Classes
Authors
-
Part of:
Volume:
10th International Symposium on Parameterized and Exact Computation (IPEC 2015)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Parameterized and Exact Computation (IPEC) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2015-11-19
Cite AsGet BibTex
Jannis Bulian and Anuj Dawar. Fixed-parameter Tractable Distances to Sparse Graph Classes. In 10th International Symposium on Parameterized and Exact Computation (IPEC 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 43, pp. 236-247, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
https://doi.org/10.4230/LIPIcs.IPEC.2015.236
https://doi.org/10.4230/LIPIcs.IPEC.2015.236
Abstract
We show that for various classes C of sparse graphs, and several measures of distance to such classes (such as edit distance and elimination distance), the problem of determining the distance of a given graph G to C is fixed-parameter tractable. The results are based on two general techniques. The first of these, building on recent work of Grohe et al. establishes that any class of graphs that is slicewise nowhere dense and slicewise first-order definable is FPT. The second shows that determining the elimination distance of a graph G to a minor-closed class C is FPT.
Keywords
- parameterized complexity
- fixed-parameter tractable
- distance
- graph theory
- sparse graphs
- graph minor
- nowhere dense
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads