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

Author

DePiero, Fred W.

Author_Institution

CalPoly State Univ., San Luis Obispo, CA, USA

Volume

3

fYear

2004

fDate

23-26 Aug. 2004

Firstpage

379

Abstract

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.

Keywords

Monte Carlo methods; combinatorial mathematics; computational complexity; graph theory; pattern matching; polynomials; Monte Carlo trials; combinatorial mathematics; computational geometry; maximum common subgraph; polynomial bounds; structural graph matching; worst case effort; Benchmark testing; Databases; Image registration; Iterative methods; Labeling; Libraries; Monte Carlo methods; Pattern recognition; Polynomials; Real time systems;

fLanguage

English

Publisher

ieee

Conference_Titel

Pattern Recognition, 2004. ICPR 2004. Proceedings of the 17th International Conference on

ISSN

1051-4651

Print_ISBN

0-7695-2128-2

Type

conf

DOI

10.1109/ICPR.2004.1334546

Filename

1334546