Abstract
The minimum common supergraph of two graphs, g 1 and g 2, is defined as the smallest graph that includes, as subgraphs, both g 1 and g 2. It is shown that minimum common supergraph computation can be solved by means of maximum common subgraph computation. For the latter problem, algorithms are known from the literature. It will also be shown that for a certain class of cost functions, the concept of graph edit distance is closely related with the minimum common supergraph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received June 11, 1999; revised December 23, 1999
Rights and permissions
About this article
Cite this article
Bunke, H., Jiang, X. & Kandel, A. On the Minimum Common Supergraph of Two Graphs. Computing 65, 13–25 (2000). https://doi.org/10.1007/PL00021410
Issue Date:
DOI: https://doi.org/10.1007/PL00021410