Measuring the Similarity of Geometric Graphs

1. Alt, H., Guibas, L.J.: Discrete geometric shapes: Matching, interpolation, and approximation. In: Handbook of Computational Geometry, pp. 121–153. Elsevier B.V., Amsterdam (2000)

   Chapter  Google Scholar 

2. Fu, K.S.: Syntactic Pattern Recognition and Applications. Prentice-Hall, Englewood Cliffs (1982)

   MATH  Google Scholar 

3. Imai, H., Iri, M.: Polygonal approximations of a curve - formulations and algorithms. In: Toussaint, G.T. (ed.) Computational Morphology, pp. 71–86. Elsevier B.V., Amsterdam (1988)

   Google Scholar 

4. Itai, A., Papadimitriou, C.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM Journal on Computing 11(4), 676–686 (1982)

   Article  MathSciNet  MATH  Google Scholar 

5. Justice, D., Hero, A.: A binary linear programming formulation of the graph edit distance. IEEE Transactions on Pattern Analysis and Machine Intelligence 28(8), 1200–1214 (2006)

   Article  Google Scholar 

6. Lucas, S., Vidal, E., Amiri, A., Hanlon, S., Amengual, J.C.: A comparison of syntactic and statistical techniques for off-line OCR. In: 2nd International Colloquium Grammatical Inference and Applications, pp. 168–179. Springer, Heidelberg (1994)

   Chapter  Google Scholar 

7. Pavlidis, T.: Structural Pattern Recognition. Springer, New York (1977)

   Book  MATH  Google Scholar 

8. Rubner, Y., Tomasi, C., Guibas, L.J.: The earth mover’s distance as a metric for image retrieval. International Journal of Computer Vision 40(2) (2000), http://robotics.stanford.edu/~rubner

Download references