Abstract
Many application problems in pattern recognition,extraction and analysis techniques of malicious code family signature and artificial intelligence can be converted into the problem of finding connected maximal common subgraph in some graphs.A new matrix algorithm which solved some simple cases,feature correlation of graph and serial correlation coefficient of graph degree was defined.At last,a greedy algorithm with example for finding connected maximal common subgraph in some graphs was proposed;the greedy algorithm can quickly and efficiently find a common connected subgraph as large as possible.
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.
