Search

We show that for various classes $\mathcal{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...

Fixed-parameter tractable Parameterized complexity Graph theory Sparse graphs Nowhere dense Excluded minor Minor-closed Deletion distance Elimination distance distance

Graph Isomorphism Canonization Parameterized complexity Fixed-parameter tractable Bounded degree Graph theory Complexity theory Tree-depth