Research on finding connected maximal common subgraph
Baogen Xu · Journal of Computer Applications · 2010
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.