## Abstract[001]A first graph embedded in a Euclidean space is modeled by a globally rigid first model graph that includes all vertices and edges of the first graph and has a preselected maximum clique size. The modelling is configured to maintain the preselected maximum clique size by employing an edge adding process that replicates a vertex of a vertex pair connected by an edge. A mapping between vertices of the first graph and vertices of a second graph is computed by optimizing a mapping between vertices of the first model graph of the second graph.
[Edit] |