On maximum common subgraph problems in series–parallel graphs

On maximum common subgraph problems in series–parallel graphs

Abstract

The complexity of the maximum common connected subgraph problem in partial -trees is still not fully understood. Polynomial-time solutions are known for degree-bounded outerplanar graphs, a subclass of the partial -trees. On the other hand, the problem is known to be NP-hard in vertex-labeled partial -trees of bounded degree. We consider series–parallel graphs, i.e., partial -trees. We show that the problem remains NP-hard in biconnected series–parallel graphs with all but one vertex of degree or less. A positive complexity result is presented for a related problem of high practical relevance which asks for a maximum common connected subgraph that preserves blocks and bridges of the input graphs. We present a polynomial time algorithm for this problem in series–parallel graphs, which utilizes a combination of BC- and SP-tree data structures to decompose both graphs.

Grafik Top
Authors
  • Kriege, Nils M.
  • Mutzel, Petra
  • Kurpicz, Florian
Grafik Top
Shortfacts
Category
Journal Paper
Divisions
Data Mining and Machine Learning
Journal or Publication Title
European Journal of Combinatorics
ISSN
0195-6698
Publisher
ScienceDirect
Date
February 2018
Export
Grafik Top