A New Algorithm For Error Tolerant Subgraph
Aerospace Bioengineering Communication, Networking & Broadcasting Components, Circuits, Devices & Systems Computing & Processing Engineered Materials, Dielectrics & Plasmas Engineering Profession Fields, Waves & Electromagnetics General Topics for Engineers Geoscience Nuclear Engineering Photonics & Electro-Optics Power, Energy, & Industry Applications Robotics & Control Systems Signal Processing & Analysis Transportation Browse Books & eBooks Conference Publications Courses Journals & Magazines Standards By Topic My Settings Content Alerts My Projects Search Alerts Preferences Purchase History Search History What can I access? Get Help About IEEE Xplore Feedback Technical Support Resources and Help Terms of Use What Can I Access? Subscribe Enter Search Term First Name / Given Name Family Name / Last Name / Surname Publication Title Volume Issue Start Page Search Basic Search Author Search Publication Search Advanced Search Other Search Options Command Search Citation Search Search Alerts Search History Page Not Found We're sorry. We cannot find a page that matches your request. Below are some suggestions that may assist: Return to the IEEE Xplore Home Page. Use your browser's Back button to return to the previous page. Contact us for assistance or to report the issue. Reason for failure: Query Not Valid Personal Sign In Create Account IEEE Account Change Username/Password Update Address Purchase Details Payment Options Order History View Purchased Documents Profile Information Communications Preferences Profession and Education Technical Interests Need Help? US & Canada: +1 800 678 4333 Worldwide: +1 732 981 0060 Contact & Support About IEEE Xplore Contact Us Help Terms of Use Nondiscrimination Policy Sitemap Privacy & Opting Out of Cookies A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.© Copyright 2016 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions. Back to Top
Transactions on Pattern Analysis and Machine Intelligence archive Volume 20 Issue 5, May 1998 Page 493-504 IEEE Computer Society Washington, DC, USA tableofcontents doi>10.1109/34.682179 1998 Article orig-research Bibliometrics ·Downloads (6 Weeks): 0 ·Downloads (12 Months): 0 ·Downloads (cumulative): 0 ·Citation Count: 112 Recent authors with related interests Concepts in this article powered by Concepts inA New Algorithm for Error-Tolerant Subgraph Isomorphism Detection Subgraph isomorphism problem In theoretical computer science, the subgraph isomorphism problem is a computational task in http://ieeexplore.ieee.org/xpl/articleDetails.jsp?reload=true&arnumber=682179 which two graphs G and H are given as input, and one must determine whether G contains a subgraph that is isomorphic to H. Subgraph isomorphism is a generalization of both the maximum clique problem and the problem of testing whether a graph contains a Hamiltonian cycle, and is therefore NP-complete. However certain other cases of http://dl.acm.org/citation.cfm?id=279277 subgraph isomorphism may be solved in polynomial time. morefromWikipedia Isomorphism In abstract algebra, an isomorphism is a bijective homomorphism. Two mathematical structures are said to be isomorphic if there is an isomorphism between them. In category theory, an isomorphism is a morphism f: X ¿ Y in a category for which there exists an "inverse" f: Y ¿ X, with the property that both ff = idX and f f = idY. morefromWikipedia Error-tolerant design An error-tolerant design is one that does not unduly penalize user errors. It is the human equivalent of fault tolerant design that allows equipment to continue functioning in the presence of hardware faults, such as a "limp-in" mode for an automobile electronics unit that would be employed if something like the oxygen sensor failed. morefromWikipedia Representation (mathematics) In mathematics, representation is a very general relationship that expresses similarities between objects. Roughly speaking, a collection Y of mathematical objects may be said to represent another collection X of objects, provided that the properties a
of study Agriculture Science Arts & Humanities Biology Chemistry http://libra.msra.cn/publication/799762/a-new-algorithm-for-error-tolerant-subgraph-isomorphism-detection Computer Science Economics & Business Engineering Environmental Sciences Geosciences Material Science Mathematics Medicine Physics Social Science Multidisciplinary Keywords (3) Compact Representation Cost Estimation Error Correction Related Publications (33) Similarity Searching in Medical Image Databases A distance measure between attributed relational graphs for pattern recognition A Graph Distance Measure for Image a new Analysis A Graduated Assignment Algorithm for Graph Matching Structural matching in computer vision using probabilistic reasoning Subscribe Academic PublicationsA New Algorithm for Error-Tolerant Subgraph Isomorphism Detection A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection,10.1109/34.682179,IEEE Transactions on Pattern Analysis and Machine Intelligence,Bru Edit A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection a new algorithm (Citations: 207) BibTex | RIS | RefWorks Download Bruno T. Messmer, Horst Bunke We propose a new algorithm for error-correcting subgraph isomorphism detection from a set of model graphs to an unknown input graph. The algorithm is based on a compact representation of the model graphs. This representation is derived from the set of model graphs in an off-line preprocessing step. The main advantage of the proposed representation is that common subgraphs of different model graphs are represented only once. Therefore, at run time, given an unknown input graph, the computational effort of matching the common subgraphs for each model graph onto the input graph is done only once. Consequently, the new algorithm is only sublinearly dependent on the number of model graphs. Furthermore, the new algorithm can be combined with a future cost estimation method that greatly improves its run-time performance Journal: IEEE Transactions on Pattern Analysis and Machine Intelligenc