## Abstract

We consider the maximum common connected edge subgraph problem and the maximum common connected induced subgraph problem for simple graphs with labeled vertices (or labeled edges). The former is to find a connected graph with the maximum number of edges that is isomorphic to a subgraph of each of the two input graphs. The latter is to find a common connected induced subgraph with the maximum number of vertices. We prove that both problems are NP-hard for 3-outerplanar labeled graphs even if the maximum vertex degree is bounded by 4. Since the reductions used in the proofs construct graphs with treewidth at most 4, both problems are NP-hard also for such graphs, which significantly improves the previous hardness results for graphs with treewidth 11. We also present improved exponential-Time algorithms for both problems on labeled graphs of bounded treewidth and bounded vertex degree.

Original language | English |
---|---|

Pages (from-to) | 253-273 |

Number of pages | 21 |

Journal | International Journal of Foundations of Computer Science |

Volume | 31 |

Issue number | 2 |

DOIs | |

State | Published - 1 Feb 2020 |

## Keywords

- Maximum common subgraph
- NP-hard
- partial k-Tree
- treewidth