On the complexity of finding iso- and other morphisms for partial k-trees
Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Enumerating all connected maximal common subgraphs in two graphs
Theoretical Computer Science
A Comparison of Algorithms for Maximum Common Subgraph on Randomly Connected Graphs
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Pattern Recognition Letters - Special issue: Graph-based representations in pattern recognition
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Information Processing Letters
IEEE Transactions on Computers
Graph Layout Problems Parameterized by Vertex Cover
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
The parameterized complexity of the induced matching problem
Discrete Applied Mathematics
Improved upper bounds for vertex cover
Theoretical Computer Science
A new approach and faster exact methods for the maximum common subgraph problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
On cutwidth parameterized by vertex cover
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Charge and reduce: A fixed-parameter algorithm for String-to-String Correction
Discrete Optimization
Preprocessing subgraph and minor problems: when does a small vertex cover help?
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Parameterized Complexity
| Hi-index | 0.89 |
The Maximum Common Induced Subgraph problem (MCIS) takes a pair of graphs as input and asks for a graph of maximum order that is isomorphic to an induced subgraph of each of the input graphs. The problem is NP-hard in general, and remains so on many graph classes including graphs of bounded treewidth. In the framework of parameterized complexity, the latter assertion means that MCIS is W[1]-hard when parameterized by the treewidths of input graphs. A classical graph parameter that has been used recently in many parameterization problems is Vertex Cover. In this paper we prove constructively that MCIS is fixed-parameter tractable when parameterized by the vertex cover numbers of the input graphs. Our algorithm is also an improved exact algorithm for the problem on instances where the minimum vertex cover is small compared to the order of input graphs.