Document Open Access Logo

Fixed-parameter Tractable Distances to Sparse Graph Classes

Authors Jannis Bulian, Anuj Dawar

Thumbnail PDF


  • Filesize: 491 kB
  • 12 pages

Document Identifiers

Author Details

Jannis Bulian
Anuj Dawar

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)


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.
  • parameterized complexity
  • fixed-parameter tractable
  • distance
  • graph theory
  • sparse graphs
  • graph minor
  • nowhere dense


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
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