Isomorphic Subgraphs

The isomorphic subgraph problem is finding two disjoint subgraphs of a graph which coincide on at least k edges. The graph is partitioned into a subgraph, its copy, and a remainder. The problem resembles the NP-hard largest common subgraph problem, which searches copies of a graph in a pair of graphs. In this paper we show that the isomorphic subgraph problem is NP-hard, even for restricted instances such as connected outerplanar graphs. Then we present two different heuristics for the computation of maximal connected isomorphic subgraphs. Both heuristics use weighting functions and have been tested on four independent test suites. Finally, we introduce a spring algorithm which preserves isomorphic subgraphs and displays them as copies of each other. The drawing algorithm yields nice drawings and emphasizes the isomorphic subgraphs. Article Type Communicated by Submitted Revised regular paper Xin He April 2003 October 2004 The work by F.-J. Brandenburg was supported in part by the G...

• Type: Conference
• Year: 1999
• Where: GD
• Authors: Sabine Bachl
• Keywords: Computer Graphics, Connected Isomorphic Subgraphs, GD 1999, Isomorphic Subgraph Problem, Isomorphic Subgraphs