A New Algorithm For Error Tolerant Subgraph Isomorphism Detection
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 Sign In Username: Password: Forgot password Other Authentication Options Create an IEEE Account Don't have an IEEE Accountyet? Register now for a free account in order to: Sign in to various IEEE sites with a single account Manage your membership Get member discounts Personalize your experience Manage your profile and order history 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.
institution loginHelpJournalsBooksRegisterJournalsBooksRegisterSign inHelpcloseSign in using your ScienceDirect credentialsUsernamePasswordRemember meForgotten username or password?Sign in via your institutionOpenAthens loginOther institution login Purchase Loading... Export You have selected 1 citation for export. Help Direct export Save to Mendeley Save to RefWorks Export file Format RIS (for EndNote, ReferenceManager, ProCite) BibTeX Text Content Citation Only Citation and Abstract Export Advanced search Close This document does not have an outline. JavaScript is disabled on your browser. Please enable JavaScript to use all the features on this page. Pattern Recognition Volume 31, Issue 2, February 1998, Pages 205-218 A http://ieeexplore.ieee.org/iel4/34/14993/00682179.pdf new algorithm for subgraph optimal isomorphism Author links open the overlay panel. Numbers correspond to the affiliation list which can be exposed by using the show more link. Opens overlay Yasser El-Sonbaty †, Opens overlay M.A. Ismail ‡ †Department of Computer and Electrical Engineering, Arab Academy for Science & Technology, Alexandria 1029, Egypt‡Department of Computer Science, University of Alexandria, Alexandria http://www.sciencedirect.com/science/article/pii/S0031320397000411 21544, Egypt Received 30 April 1996, Accepted 13 February 1997, Available online 18 June 1998 Show more Choose an option to locate/access this article: Check if you have access through your login credentials or your institution. Check access Purchase Sign in using your ScienceDirect credentials Username: Password: Remember me Not Registered? Forgotten username or password? OpenAthens login Login via your institution Other institution login doi:10.1016/S0031-3203(97)00041-1 Get rights and content AbstractIn this paper a new algorithm for subgraph isomorphism is proposed. The main idea of the new algorithm is to decompose the graphs to be matched into smaller subgraphs. The matching process is then done at the level of the decomposed subgraphs based on the concept of error-correcting transformations. The cost of matching two graphs is defined as the minimum of a weighted bipartite graph constructed from the decomposed subgraphs. The average computational complexity of the proposed algorithm is found to be O(N4). The results of the application of the new algorithm show that the new technique is quite efficient and, in many respects, superior to similar existing techniqu
Communication, Networking & Broadcasting http://www.ieeeexplore.ws/xpl/articleDetails.jsp?arnumber=682179&filter%3DAND(p_IS_Number%3A14993) 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 a new & 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 a new algorithm Technical Support Resources and Help Terms of Use What Can I Access? Subscribe 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.