Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
109
click to vote
ICPR
2004
IEEE
112
views
computer vision
»
more
ICPR 2004
»
Structural Graph Matching With Polynomial Bounds On Memory and on Worst-Case Effort
16 years 4 months ago
Download
courseware.ee.calpoly.edu
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 ...
Fred W. DePiero
claim paper
Read More »