Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
Journal of the ACM (JACM)
Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters
Node-and edge-deletion NP-complete problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Graph Edit Distance from Spectral Seriation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Parameterized Graph Cleaning Problems
Graph-Theoretic Concepts in Computer Science
Parameterized complexity of finding regular induced subgraphs
Journal of Discrete Algorithms
Parameterized graph cleaning problems
Discrete Applied Mathematics
Parameterized complexity of eulerian deletion problems
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
We consider the problem that, given a graph G and a parameter k, asks whether the edit distance of G and a rectangular grid is at most k. We examine the general case where the edit operations are vertex/edge removals and additions. If the dimensions of the grid are given in advance, we give a parameterized algorithm that runs in 2O(logk· k)+O(n3) steps. In the case where the dimensions of the grid are not given we give a parameterized algorithm that runs in 2O(logk·k)+O(k2·n3) steps. We insist on parameterized algorithms with running times where the relation between the polynomial and the non-polynomial part is additive. Our algorithm is based on the technique of kernelization. In particular we prove that for each version of the above problem there exists a kernel of size O(k4).