loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
17th International Conference on Pattern Recognition (ICPR'04) - Volume 3
Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort
Cambridge UK
August 23-August 26
ISBN: 0-7695-2128-2
ASCII Text
x 
 
Fred W. DePiero, "Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort," Pattern Recognition, International Conference on, vol. 3, pp. 379-382, 17th International Conference on Pattern Recognition (ICPR'04) - Volume 3, 2004.
 
 
BibTex
x
 
@article{ 10.1109/ICPR.2004.1334546,
author = {Fred W. DePiero},
title = {Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort},
journal ={Pattern Recognition, International Conference on},
volume = {3},
year = {2004},
issn = {1051-4651},
pages = {379-382},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICPR.2004.1334546},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Pattern Recognition, International Conference on
TI - Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort
SN - 1051-4651
SP379
EP382
A1 - Fred W. DePiero,
PY - 2004
KW - null
VL - 3
JA - Pattern Recognition, International Conference on
ER -
 
Fred W. DePiero, CalPoly State University, San Luis Obispo, CA
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 in 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.
Citation:
Fred W. DePiero, "Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort," icpr, vol. 3, pp.379-382, 17th International Conference on Pattern Recognition (ICPR'04) - Volume 3, 2004
Usage of this product signifies your acceptance of the Terms of Use.