Abstract
Subgraph matching (aka graph pattern matching or the subgraph isomorphism problem) is NP-complete. But in practice subgraph matching should be performed in reasonable time if possible. In this work a heuristically optimizing approach to subgraph matching on labeled graphs is described. It relies on the fact that the runtime of the matching process can vary significantly for dierent matching strategies. The finding of a good matching strategy is stated as an optimization problem which is solved heuristically. The cost model for the possible matching strategies takes the structure of the present host graph into account. The necessary information can be obtained by an analysis of the host graph.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
