PARSED CONTENT

The web site states the following, "Measuring the dissimilarity between graphs is a key step in data analysis based on graph representations." We noticed that the web page also stated " This contest focusses on the definition and the computation of general dissimilarity measures through two challenges." It also said " Computation of the exact or an approximate graph edit distance. Computation of a dissimilarity measure for graph classification. This contest is supported by the Technical Committee on Graph-Based Representations in Pattern Recognition TC 15." The header had graph edit distance as the highest ranking optimized keyword. This keyword is followed by ged, error-tolerant graph matching, and graph dissimilarity which isn't as urgent as graph edit distance. The other words gdc2016.greyc.fr uses is edit path. graph classification is included and will not be understood by search crawlers.