Highly Influenced

# Mean and maximum common subgraph of two graphs

@article{Bunke2000MeanAM, title={Mean and maximum common subgraph of two graphs}, author={Horst Bunke and Abraham Kandel}, journal={Pattern Recognition Letters}, year={2000}, volume={21}, pages={163-168} }

- Published 2000 in Pattern Recognition Letters
DOI:10.1016/S0167-8655(99)00143-9

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

#### Citations

##### Publications citing this paper.

#### Citation Statistics

#### 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.

#### References

##### Publications referenced by this paper.

Showing 1-9 of 9 references

Highly Influential