Fast graph matching for detecting CAD image components

The performance of an attributed relational graph (ARG) matching algorithm, tailored for dealing with large graphs, is evaluated in the context of a real application. The detection of component parts in CAD images of mechanical drawings. The matching problem is a graph-subgraph isomorphism and the algorithm exploits semantic information about nodes while does not require information about the topology of the graphs to be matched. Experimental results, compared with those obtained with a different method, show the overall efficiency of the algorithm and the matching time reduction obtainable by exploiting the semantic information held by ARGs