By Topic

Structural graph matching with polynomial bounds on memory and on worst-case effort

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
DePiero, F.W. ; CalPoly State Univ., San Luis Obispo, CA, USA

A new method of structural graph matching is introduced and compared against an existing method and against the maximum common subgraph. The method is approximate with polynomial bounds on both memory and on the worst-case compute effort. Methods work on arbitrary types of graphs and tests with strongly regular graphs are included. No node or edge colors are needed in the methods; the common subgraph is extracted based on structural comparisons only. Monte Carlo trials are benchmarked with 100% additional (clutter) nodes. Results are shown to be typically within 1-2 nodes of the maximum common subgraph. Over 7500 test trials are reported with graphs up to 100 nodes.

Published in:

Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on  (Volume:3 )

Date of Conference:

23-26 Aug. 2004