Mean and maximum common subgraph of two graphs

  title={Mean and maximum common subgraph of two graphs},
  author={Horst Bunke and Abraham Kandel},
  journal={Pattern Recognition Letters},
A mean of a pair of graphs, g1 and g2, is formally de®ned as a graph that minimizes the sum of edit distances to g1 and g2. The edit distance of two graphs g and g0 is the minimum cost taken over all sequences of edit operations that transform g into g0. It will be shown that under a particular set of cost functions for any two graphs, g and g0, a maximum common subgraph is a mean. Moreover, any subgraph of g or g0 that contains a maximum common subgraph is a mean as well. Ó 2000 Elsevier… CONTINUE READING
Highly Cited
This paper has 73 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.
38 Citations
9 References
Similar Papers


Publications citing this paper.

73 Citations

Citations per Year
Semantic Scholar estimates that this publication has 73 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-9 of 9 references

Combinatorial search vs. genetic algorithms: a case study based on the mean graph problem

  • A. unger, X. Jiang
  • Pattern Recognition Letters
  • 1999

A greedy algorithm for computing approximate median strings

  • F. Casacuberta, M. D. de Antonio
  • Proc. Symposium on Pattern Recognition and Image…
  • 1997

A di€erence algorithm for OCR-generated text

  • S. V. Rice, J. Kanai, T. A. Nartker
  • Advances in Structural and Syntactic Pattern…
  • 1992
1 Excerpt

A note on the derivation of maximal common subgraphs of two directed or undirected graphs

  • G. Levi
  • Calcolo
  • 1972
2 Excerpts

Similar Papers

Loading similar papers…