On the Relation between the Common Labelling and the Median Graph
In structural pattern recognition, given a set of graphs, the computation of a Generalized Median Graph is a well known problem. Some methods approach the problem by assuming a relation between the Generalized Median Graph and the Common Labelling problem. However, this relation has still not been formally proved. In this paper, we analyse such relation between both problems. The main result proves that the cost of the common labelling upper-bounds the cost of the median with respect to the given set. In addition, we show that the two problems are equivalent in some cases.
KeywordsCost Function Weighted Graph Virtual Node Graph Match Permutation Matrice
- 3.Zeng, Z., Tung, A.K.H., Wang, J., Feng, J., Zhou, L.: Comparing stars: on approximating graph edit distance. In: Proc. VLDB Endow., vol. 2(1), pp. 25–36 (August 2009)Google Scholar
- 7.Hlaoui, A., Wang, S.: Median graph computation for graph clustering. Soft Computing - A Fusion of Foundations, Methodologies and Applications 10, 47–53 (2006)Google Scholar
- 14.Solé-Ribalta, A.: Multiple graph matching and applications. PhD thesis, Universitat Rovira i Virgili (2012)Google Scholar
- 15.Wong, A.K.C., You, M.: Entropy and distance of random graphs with application to structural pattern recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence (5), 599–609 (1985)Google Scholar